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 13, 2026 00:27Victor MerckléVictor MerckléScore: 4,819Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2026 00:294,76847,975,13838,486,0001,092,0002,117,632stderr
2Aug 13, 2026 00:294,80048,296,22138,743,0001,097,0002,117,632stderr
3Aug 13, 2026 00:294,80148,354,94238,751,0001,101,0002,117,632stderr
4Aug 13, 2026 00:294,80748,335,07938,868,0001,033,0002,117,632stderr
5Aug 13, 2026 00:294,81948,184,88238,911,0001,092,0002,117,632stderr
6Aug 13, 2026 00:294,85948,715,62739,252,0001,080,0002,117,632stderr
7Aug 13, 2026 00:294,94149,430,80739,963,0001,050,0002,117,632stderr
8Aug 13, 2026 00:294,95849,600,55540,113,0001,044,0002,117,632stderr
9Aug 13, 2026 00:295,11650,655,23441,205,0001,259,0002,117,632stderr