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 10, 2026 13:10wnwnScore: 3,437Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 13:113,42038,822,71128,394,00002,113,536
2May 10, 2026 13:113,42137,442,06428,401,00002,113,536
3May 10, 2026 13:113,42338,524,07528,416,00002,113,536
4May 10, 2026 13:113,43038,803,58528,472,00002,113,536
5May 10, 2026 13:113,43739,199,35928,529,00002,113,536
6May 10, 2026 13:113,44038,524,82928,559,00002,113,536
7May 10, 2026 13:113,44138,437,73228,563,00002,113,536
8May 10, 2026 13:113,45538,684,28428,681,00002,113,536
9May 10, 2026 13:113,46038,280,94228,718,00002,113,536