Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listFeb 24, 2026 20:41Mikołaj UzarskiMikołaj UzarskiScore: 5,884Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 20:415,82270,621,32745,300,0003,020,0002,281,472
2Feb 24, 2026 20:415,84271,333,17247,481,0001,010,0002,277,376
3Feb 24, 2026 20:415,86079,026,49647,622,0001,013,0002,502,656
4Feb 24, 2026 20:415,88280,228,21346,825,0001,992,0002,502,656
5Feb 24, 2026 20:415,88473,663,54947,817,0001,017,0002,277,376
6Feb 24, 2026 20:415,89973,096,84046,963,0001,998,0002,285,568
7Feb 24, 2026 20:415,90074,698,81545,973,0002,998,0002,510,848
8Feb 24, 2026 20:415,92675,243,94548,179,0001,003,0002,506,752
9Feb 24, 2026 20:415,92772,328,57947,185,0002,007,0002,285,568