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 24, 2026 20:19Victor MerckléVictor MerckléScore: 5,905Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 20:195,86056,995,07347,583,0001,056,0002,117,632stderr
2Aug 24, 2026 20:195,88057,248,42147,733,0001,078,0002,117,632stderr
3Aug 24, 2026 20:195,89058,562,34747,806,0001,081,0002,117,632stderr
4Aug 24, 2026 20:195,89157,453,51147,830,0001,067,0002,117,632stderr
5Aug 24, 2026 20:195,90557,357,56947,819,0001,197,0002,117,632stderr
6Aug 24, 2026 20:195,90557,179,64647,963,0001,056,0002,117,632stderr
7Aug 24, 2026 20:195,93357,584,46748,204,0001,041,0002,117,632stderr
8Aug 24, 2026 20:195,94057,715,95548,236,0001,073,0002,117,632stderr
9Aug 24, 2026 20:196,12659,240,34449,825,0001,023,0002,117,632stderr