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 04:43Kevin HeaveyKevin HeaveyScore: 4,344Success
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 04:504,29045,547,83633,431,0002,177,0002,113,536
2Jul 22, 2026 04:504,31845,776,69933,714,0002,127,0002,113,536
3Jul 22, 2026 04:504,32545,789,45633,779,0002,121,0002,113,536
4Jul 22, 2026 04:504,34351,011,52133,887,0002,163,0002,113,536
5Jul 22, 2026 04:504,34450,970,18933,734,0002,325,0002,113,536
6Jul 22, 2026 04:504,34946,606,69233,748,0002,352,0002,113,536
7Jul 22, 2026 04:504,47646,980,11134,893,0002,259,0002,113,536
8Jul 22, 2026 04:504,52847,520,20735,400,0002,185,0002,113,536
9Jul 22, 2026 04:504,54248,220,75235,449,0002,254,0002,113,536