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 13, 2026 15:18Victor MerckléVictor MerckléScore: 7,894Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 15:187,88973,637,97564,477,0001,006,0002,113,536
2May 13, 2026 15:187,88974,846,08365,479,00002,113,536
3May 13, 2026 15:187,88973,069,06665,481,00002,113,536
4May 13, 2026 15:187,89472,816,36264,512,0001,010,0002,113,536
5May 13, 2026 15:187,89473,611,08364,510,0001,018,0002,113,536
6May 13, 2026 15:187,90073,495,26764,544,0001,028,0002,113,536
7May 13, 2026 15:187,90075,401,07164,539,0001,036,0002,113,536
8May 13, 2026 15:187,90873,472,31964,628,0001,012,0002,113,536
9May 13, 2026 15:187,97975,236,12166,228,00002,113,536