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 11, 2026 15:59Victor MerckléVictor MerckléScore: 3,856Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 16:003,84440,328,88030,850,0001,061,0002,117,632stderr
2Aug 11, 2026 16:003,84840,424,48230,912,0001,032,0002,117,632stderr
3Aug 11, 2026 16:003,85240,346,37730,929,0001,043,0002,117,632stderr
4Aug 11, 2026 16:003,85440,374,60830,752,0001,240,0002,117,632stderr
5Aug 11, 2026 16:003,85640,411,43830,982,0001,029,0002,117,632stderr
6Aug 11, 2026 16:003,85741,728,94530,982,0001,038,0002,117,632stderr
7Aug 11, 2026 16:003,86140,521,53730,883,0001,168,0002,117,632stderr
8Aug 11, 2026 16:003,97641,422,92531,844,0001,164,0002,117,632stderr
9Aug 11, 2026 16:004,22843,456,08934,067,0001,033,0002,117,632stderr