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 listJun 11, 2026 21:45Victor MerckléVictor MerckléScore: 4,580Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 11, 2026 21:454,55245,509,37336,681,0001,101,0002,113,536
2Jun 11, 2026 21:454,55745,429,04236,720,0001,108,0002,113,536
3Jun 11, 2026 21:454,56245,367,15036,751,0001,115,0002,113,536
4Jun 11, 2026 21:454,56345,461,75136,767,0001,107,0002,113,536
5Jun 11, 2026 21:454,58045,527,37736,999,0001,022,0002,113,536
6Jun 11, 2026 21:454,58345,559,19536,938,0001,108,0002,113,536
7Jun 11, 2026 21:454,63546,036,64737,381,0001,097,0002,113,536
8Jun 11, 2026 21:454,73346,844,00338,265,0001,025,0002,113,536
9Jun 11, 2026 21:454,77747,319,23838,545,0001,109,0002,113,536