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 12, 2026 10:37Victor MerckléVictor MerckléScore: 10,112Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 10:3710,09694,065,27082,692,0001,112,0002,113,536
2May 12, 2026 10:3710,09894,371,11082,716,0001,104,0002,113,536
3May 12, 2026 10:3710,10994,831,91382,726,0001,184,0002,113,536
4May 12, 2026 10:3710,11094,876,36882,745,0001,175,0002,113,536
5May 12, 2026 10:3710,11292,920,92282,934,0001,003,0002,113,536
6May 12, 2026 10:3710,11393,765,72682,917,0001,023,0002,113,536
7May 12, 2026 10:3710,11494,548,00782,771,0001,178,0002,113,536
8May 12, 2026 10:3710,11594,913,75382,770,0001,185,0002,113,536
9May 12, 2026 10:3710,13694,959,18382,966,0001,165,0002,113,536