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 14, 2026 05:14Victor MerckléVictor MerckléScore: 7,249Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 05:157,24068,659,48060,097,00002,113,536
2May 14, 2026 05:157,24069,328,73259,074,0001,026,0002,113,536
3May 14, 2026 05:157,24668,285,13959,145,0001,002,0002,113,536
4May 14, 2026 05:157,24668,649,62460,144,00002,113,536
5May 14, 2026 05:157,24969,425,17260,171,00002,113,536
6May 14, 2026 05:157,25067,786,87559,167,0001,009,0002,113,536
7May 14, 2026 05:157,25169,272,89159,150,0001,038,0002,113,536
8May 14, 2026 05:157,30568,772,33859,617,0001,015,0002,113,536
9May 14, 2026 05:157,40770,230,77760,444,0001,040,0002,113,536