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 18, 2026 15:16Kevin HeaveyKevin HeaveyScore: 3,713Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 18, 2026 15:223,65740,025,16329,307,0001,048,0002,113,536
2Jul 18, 2026 15:223,68840,213,31529,576,0001,042,0002,113,536
3Jul 18, 2026 15:223,70740,445,39829,600,0001,171,0002,113,536
4Jul 18, 2026 15:223,70940,412,35429,607,0001,180,0002,113,536
5Jul 18, 2026 15:223,71340,416,19729,780,0001,046,0002,113,536
6Jul 18, 2026 15:223,80141,545,10530,411,0001,142,0002,113,536
7Jul 18, 2026 15:223,80841,845,74330,467,0001,146,0002,113,536
8Jul 18, 2026 15:223,85842,306,03830,845,0001,181,0002,113,536
9Jul 18, 2026 15:223,89541,933,51731,198,0001,136,0002,113,536