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 listJul 22, 2026 18:41Kevin HeaveyKevin HeaveyScore: 3,834Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 18:423,80041,233,63330,278,0001,269,0002,113,536
2Jul 22, 2026 18:423,80547,839,19630,357,0001,232,0002,113,536
3Jul 22, 2026 18:423,81041,332,95630,430,0001,199,0002,113,536
4Jul 22, 2026 18:423,81141,345,98830,436,0001,198,0002,113,536
5Jul 22, 2026 18:423,83441,523,72330,575,0001,255,0002,113,536
6Jul 22, 2026 18:423,83441,537,41430,795,0001,028,0002,113,536
7Jul 22, 2026 18:4263,655537,990,696527,095,0001,242,0002,113,536
8Jul 22, 2026 18:4263,677538,193,732527,293,0001,232,0002,113,536
9Jul 22, 2026 18:4264,337543,744,404532,998,0001,001,0002,113,536