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 25, 2026 01:56Victor MerckléVictor MerckléScore: 3,908Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 25, 2026 01:573,87740,549,89731,016,0001,165,0002,117,632stderr
2Aug 25, 2026 01:573,89041,339,57531,141,0001,151,0002,117,632stderr
3Aug 25, 2026 01:573,90340,716,80831,335,0001,062,0002,117,632stderr
4Aug 25, 2026 01:573,90740,751,21031,385,0001,047,0002,117,632stderr
5Aug 25, 2026 01:573,90840,783,49031,344,0001,095,0002,117,632stderr
6Aug 25, 2026 01:573,91340,883,85031,423,0001,063,0002,117,632stderr
7Aug 25, 2026 01:573,91640,864,36331,390,0001,117,0002,117,632stderr
8Aug 25, 2026 01:573,91940,859,31831,428,0001,106,0002,117,632stderr
9Aug 25, 2026 01:574,00641,542,75132,196,0001,061,0002,117,632stderr