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 13:33Kevin HeaveyKevin HeaveyScore: 4,058Success
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 13:404,04443,374,15930,402,0003,165,0002,121,728
2Jul 22, 2026 13:404,04743,507,48030,471,0003,123,0002,121,728
3Jul 22, 2026 13:404,05143,473,15430,466,0003,161,0002,121,728
4Jul 22, 2026 13:404,05643,617,45130,521,0003,149,0002,121,728
5Jul 22, 2026 13:404,05843,520,85730,450,0003,234,0002,125,824
6Jul 22, 2026 13:404,07243,792,91630,525,0003,275,0002,121,728
7Jul 22, 2026 13:404,07343,777,41130,581,0003,231,0002,125,824
8Jul 22, 2026 13:404,07443,728,54230,606,0003,210,0002,121,728
9Jul 22, 2026 13:404,08543,719,79230,806,0003,104,0002,121,728