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 19, 2026 16:21Milo PresedoMilo PresedoScore: 8,002Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 19, 2026 16:227,99074,516,69965,137,0001,185,0002,113,536
2May 19, 2026 16:227,99674,097,70765,181,0001,190,0002,113,536
3May 19, 2026 16:227,99774,993,57665,155,0001,227,0002,113,536
4May 19, 2026 16:228,00177,359,61765,206,0001,209,0002,113,536
5May 19, 2026 16:228,00276,810,83165,207,0001,213,0002,113,536
6May 19, 2026 16:228,00376,030,27865,208,0001,221,0002,113,536
7May 19, 2026 16:228,00576,655,48665,253,0001,191,0002,113,536
8May 19, 2026 16:228,00878,947,98665,273,0001,197,0002,113,536
9May 19, 2026 16:228,01174,250,93065,294,0001,203,0002,113,536