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 15:46Josu San MartinJosu San MartinScore: 3,993Success
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 15:463,96841,524,61231,912,0001,027,0002,113,536
2May 10, 2026 15:463,97142,310,00631,944,0001,023,0002,113,536
3May 10, 2026 15:463,98143,202,55732,015,0001,029,0002,113,536
4May 10, 2026 15:463,99240,392,37532,121,0001,018,0002,113,536
5May 10, 2026 15:463,99340,893,68632,146,0001,002,0002,113,536
6May 10, 2026 15:464,00055,077,89432,129,0001,074,0002,113,536
7May 10, 2026 15:464,00040,864,85932,192,0001,015,0002,113,536
8May 10, 2026 15:464,01042,955,70532,265,0001,022,0002,113,536
9May 10, 2026 15:464,12744,470,55233,221,0001,040,0002,113,536