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 12, 2026 03:03Victor MerckléVictor MerckléScore: 3,792Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2026 03:043,77839,752,77030,269,0001,094,0002,117,632stderr
2Aug 12, 2026 03:043,77839,770,93930,243,0001,119,0002,117,632stderr
3Aug 12, 2026 03:043,77839,951,06130,240,0001,122,0002,117,632stderr
4Aug 12, 2026 03:043,78839,861,24030,342,0001,105,0002,117,632stderr
5Aug 12, 2026 03:043,79239,897,79130,310,0001,166,0002,117,632stderr
6Aug 12, 2026 03:043,79440,671,59730,317,0001,174,0002,117,632stderr
7Aug 12, 2026 03:043,80440,635,91230,419,0001,155,0002,117,632stderr
8Aug 12, 2026 03:043,80740,050,03430,515,0001,085,0002,117,632stderr
9Aug 12, 2026 03:044,03541,875,19532,407,0001,086,0002,117,632stderr