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 02:43Josu San MartinJosu San MartinScore: 4,703Success
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 02:444,66054,585,72937,552,0001,129,0002,482,176
2May 10, 2026 02:444,66551,311,55637,555,0001,169,0002,486,272
3May 10, 2026 02:444,68354,082,02737,754,0001,122,0002,478,080
4May 10, 2026 02:444,68654,508,71537,759,0001,140,0002,494,464
5May 10, 2026 02:444,70354,781,16537,897,0001,138,0002,486,272
6May 10, 2026 02:444,78755,826,74838,587,0001,151,0002,486,272
7May 10, 2026 02:444,79953,983,44038,704,0001,134,0002,478,080
8May 10, 2026 02:444,84255,322,29639,037,0001,158,0002,482,176
9May 10, 2026 02:444,87357,222,59239,294,0001,153,0002,494,464