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 listMay 10, 2026 10:08Josu San MartinJosu San MartinScore: 4,108Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 10:094,07949,035,81632,741,0001,122,0002,486,272
2May 10, 2026 10:094,08648,112,77132,740,0001,182,0002,498,560
3May 10, 2026 10:094,09052,067,82432,830,0001,123,0002,486,272
4May 10, 2026 10:094,10653,294,88733,035,0001,052,0002,490,368
5May 10, 2026 10:094,10853,370,12833,042,0001,055,0002,478,080
6May 10, 2026 10:094,10851,644,79433,029,0001,069,0002,490,368
7May 10, 2026 10:094,11552,123,22733,099,0001,057,0002,490,368
8May 10, 2026 10:094,11648,509,90532,906,0001,259,0002,482,176
9May 10, 2026 10:094,11849,754,56733,126,0001,056,0002,486,272