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 14, 2026 20:32Kevin HeaveyKevin HeaveyScore: 3,708Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 14, 2026 20:333,68240,067,30229,542,0001,024,0002,117,632
2Jul 14, 2026 20:333,68640,262,93929,576,0001,022,0002,117,632
3Jul 14, 2026 20:333,69340,189,43529,634,0001,025,0002,117,632
4Jul 14, 2026 20:333,69640,328,09329,656,0001,026,0002,117,632
5Jul 14, 2026 20:333,70840,412,79729,751,0001,026,0002,117,632
6Jul 14, 2026 20:333,72740,558,54929,912,0001,030,0002,117,632
7Jul 14, 2026 20:335,36854,217,20343,537,0001,019,0002,117,632
8Jul 14, 2026 20:335,44554,795,39944,185,0001,015,0002,117,632
9Jul 14, 2026 20:335,52555,515,97444,818,0001,041,0002,117,632