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 17, 2026 00:19Kevin HeaveyKevin HeaveyScore: 3,754Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 17, 2026 00:243,69340,593,67229,607,0001,050,0002,113,536
2Jul 17, 2026 00:243,70340,552,17029,691,0001,050,0002,113,536
3Jul 17, 2026 00:243,71140,570,34229,758,0001,051,0002,113,536
4Jul 17, 2026 00:243,71640,658,63229,792,0001,051,0002,113,536
5Jul 17, 2026 00:243,75440,908,76630,114,0001,048,0002,113,536
6Jul 17, 2026 00:243,76544,314,95230,163,0001,090,0002,113,536
7Jul 17, 2026 00:243,81141,407,45330,583,0001,050,0002,113,536
8Jul 17, 2026 00:243,98943,132,02132,067,0001,046,0002,113,536
9Jul 17, 2026 00:244,03943,945,68632,478,0001,047,0002,113,536