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:28Victor MerckléVictor MerckléScore: 3,805Success
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:293,76639,668,38630,114,0001,151,0002,117,632stderr
2Aug 12, 2026 01:293,77639,759,09330,202,0001,140,0002,117,632stderr
3Aug 12, 2026 01:293,78039,748,82330,291,0001,086,0002,117,632stderr
4Aug 12, 2026 01:293,78739,893,61030,318,0001,119,0002,117,632stderr
5Aug 12, 2026 01:293,80540,065,23330,471,0001,112,0002,117,632stderr
6Aug 12, 2026 01:293,81240,051,14130,493,0001,147,0002,117,632stderr
7Aug 12, 2026 01:293,82040,182,56330,502,0001,204,0002,117,632stderr
8Aug 12, 2026 01:293,82740,148,37530,645,0001,127,0002,117,632stderr
9Aug 12, 2026 01:293,85040,357,36030,836,0001,126,0002,117,632stderr