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 listAug 28, 2026 05:05Victor MerckléVictor MerckléScore: 3,712Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 05:053,70339,846,14629,579,0001,164,0002,113,536
2Aug 28, 2026 05:053,70739,075,34529,638,0001,136,0002,113,536
3Aug 28, 2026 05:053,71139,120,72729,701,0001,104,0002,113,536
4Aug 28, 2026 05:053,71239,210,19129,684,0001,132,0002,113,536
5Aug 28, 2026 05:053,71239,098,60029,740,0001,073,0002,113,536
6Aug 28, 2026 05:053,71939,217,90329,797,0001,075,0002,113,536
7Aug 28, 2026 05:053,73539,835,63229,887,0001,118,0002,113,536
8Aug 28, 2026 05:053,74639,369,87730,036,0001,061,0002,113,536
9Aug 28, 2026 05:053,77039,576,64630,216,0001,082,0002,113,536