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 16, 2026 02:58Victor MerckléVictor MerckléScore: 6,967Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 02:586,95967,172,55156,712,0001,048,0002,113,536
2May 16, 2026 02:586,96365,124,67956,757,0001,043,0002,113,536
3May 16, 2026 02:586,96665,093,40757,820,00002,113,536
4May 16, 2026 02:586,96767,514,36157,828,00002,113,536
5May 16, 2026 02:586,96767,820,70456,833,0001,000,0002,113,536
6May 16, 2026 02:586,96865,327,68656,835,0001,001,0002,113,536
7May 16, 2026 02:586,96966,865,76657,845,00002,113,536
8May 16, 2026 02:586,97066,934,81957,856,00002,113,536
9May 16, 2026 02:587,07966,414,88957,710,0001,048,0002,113,536