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 03:23Josu San MartinJosu San MartinError
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 03:24057,074,35038,698,0001,115,0002,486,272expected "53689996289849521 ", got "53689996339627626 "
2May 10, 2026 03:244,60254,399,67937,062,0001,140,0002,486,272
3May 10, 2026 03:244,60354,248,62337,069,0001,144,0002,482,176
4May 10, 2026 03:244,60553,776,55237,186,0001,036,0002,478,080
5May 10, 2026 03:244,61052,316,70837,136,0001,128,0002,482,176
6May 10, 2026 03:244,61854,030,52537,219,0001,112,0002,478,080
7May 10, 2026 03:244,62454,997,85637,329,0001,058,0002,486,272
8May 10, 2026 03:244,62556,726,07137,275,0001,118,0002,494,464
9May 10, 2026 03:244,65856,048,43337,524,0001,138,0002,498,560