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 02:31Victor MerckléVictor MerckléScore: 7,156Success
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 02:327,11467,418,09557,946,0001,101,0002,117,632stderr
2Aug 25, 2026 02:327,13367,625,49658,065,0001,143,0002,117,632stderr
3Aug 25, 2026 02:327,14767,721,59258,297,0001,028,0002,117,632stderr
4Aug 25, 2026 02:327,15567,814,55158,234,0001,155,0002,117,632stderr
5Aug 25, 2026 02:327,15667,788,46958,325,0001,078,0002,117,632stderr
6Aug 25, 2026 02:327,16367,869,00858,371,0001,089,0002,117,632stderr
7Aug 25, 2026 02:327,18468,019,73858,540,0001,093,0002,117,632stderr
8Aug 25, 2026 02:327,23568,490,96158,882,0001,170,0002,117,632stderr
9Aug 25, 2026 02:327,61377,422,01661,934,0001,256,0002,117,632stderr