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 24, 2026 19:24Kevin HeaveyKevin HeaveyScore: 3,637Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 24, 2026 19:253,50637,439,42228,072,0001,033,0002,113,536
2Jul 24, 2026 19:253,51037,479,21527,907,0001,229,0002,113,536
3Jul 24, 2026 19:253,52637,591,86528,045,0001,222,0002,113,536
4Jul 24, 2026 19:253,59438,218,98728,597,0001,237,0002,113,536
5Jul 24, 2026 19:253,63738,770,24529,159,0001,033,0002,113,536
6Jul 24, 2026 19:253,65738,705,03529,230,0001,130,0002,113,536
7Jul 24, 2026 19:253,75839,557,54130,149,0001,045,0002,113,536
8Jul 24, 2026 19:253,82240,109,22630,476,0001,248,0002,113,536
9Jul 24, 2026 19:253,83640,186,84730,649,0001,198,0002,113,536