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 12:21Victor MerckléVictor MerckléScore: 4,497Success
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 12:214,43845,163,92535,661,0001,175,0002,113,536
2Aug 28, 2026 12:214,46045,285,74435,823,0001,199,0002,113,536
3Aug 28, 2026 12:214,47145,397,81236,102,0001,015,0002,113,536
4Aug 28, 2026 12:214,48945,569,93736,074,0001,187,0002,113,536
5Aug 28, 2026 12:214,49745,709,98836,160,0001,170,0002,113,536
6Aug 28, 2026 12:214,52645,872,45936,369,0001,205,0002,113,536
7Aug 28, 2026 12:214,52745,907,39336,570,0001,012,0002,113,536
8Aug 28, 2026 12:214,55546,179,84236,793,0001,017,0002,113,536
9Aug 28, 2026 12:214,65246,908,94637,337,0001,280,0002,113,536