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 23, 2026 17:45Victor MerckléVictor MerckléScore: 3,769Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 23, 2026 17:463,74239,488,45629,952,0001,107,0002,117,632stderr
2Aug 23, 2026 17:463,75239,489,07630,065,0001,082,0002,117,632stderr
3Aug 23, 2026 17:463,75639,844,99230,058,0001,123,0002,117,632stderr
4Aug 23, 2026 17:463,76239,609,93530,110,0001,119,0002,117,632stderr
5Aug 23, 2026 17:463,76939,660,80130,198,0001,086,0002,117,632stderr
6Aug 23, 2026 17:463,77239,729,55530,178,0001,130,0002,117,632stderr
7Aug 23, 2026 17:463,78340,499,61630,130,0001,273,0002,117,632stderr
8Aug 23, 2026 17:463,81540,146,44430,604,0001,062,0002,117,632stderr
9Aug 23, 2026 17:464,01641,766,22832,241,0001,092,0002,117,632stderr