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 01:23Victor MerckléVictor MerckléScore: 3,816Success
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 01:243,77039,692,73930,170,0001,122,0002,117,632stderr
2Aug 12, 2026 01:243,79739,952,56330,353,0001,170,0002,117,632stderr
3Aug 12, 2026 01:243,80940,018,79530,499,0001,121,0002,117,632stderr
4Aug 12, 2026 01:243,81340,114,66030,415,0001,240,0002,117,632stderr
5Aug 12, 2026 01:243,81640,069,30330,596,0001,077,0002,117,632stderr
6Aug 12, 2026 01:243,81940,083,48730,632,0001,070,0002,117,632stderr
7Aug 12, 2026 01:243,83840,328,82730,730,0001,129,0002,117,632stderr
8Aug 12, 2026 01:243,91740,884,43431,449,0001,066,0002,117,632stderr
9Aug 12, 2026 01:243,99141,539,59332,062,0001,065,0002,117,632stderr