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 listMay 24, 2026 19:27Victor MerckléVictor MerckléScore: 6,153Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2026 19:286,01057,667,63248,805,0001,083,0002,113,536
2May 24, 2026 19:286,10261,823,93649,643,0001,004,0002,113,536
3May 24, 2026 19:286,11859,913,02649,752,0001,029,0002,113,536
4May 24, 2026 19:286,12460,347,28549,810,0001,024,0002,113,536
5May 24, 2026 19:286,15364,171,30850,048,0001,028,0002,113,536
6May 24, 2026 19:286,18262,310,53250,296,0001,016,0002,113,536
7May 24, 2026 19:286,18362,194,77850,208,0001,114,0002,113,536
8May 24, 2026 19:286,33364,326,47551,541,0001,028,0002,113,536
9May 24, 2026 19:286,46663,562,26752,636,0001,037,0002,113,536