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 19:05Josu 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 19:06040,545,90931,425,0001,079,0002,113,536expected "53685085545193779 ", got "53685084571050625 "
2May 10, 2026 19:063,86443,302,52630,963,0001,114,0002,113,536
3May 10, 2026 19:063,86441,237,21330,975,0001,102,0002,113,536
4May 10, 2026 19:063,88141,136,66231,138,0001,075,0002,113,536
5May 10, 2026 19:063,88139,717,12631,112,0001,104,0002,113,536
6May 10, 2026 19:063,88639,628,09331,188,0001,068,0002,113,536
7May 10, 2026 19:063,91041,940,07731,417,0001,039,0002,113,536
8May 10, 2026 19:063,91040,023,44931,362,0001,096,0002,113,536
9May 10, 2026 19:063,92541,398,37731,498,0001,084,0002,113,536