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 15:35Victor MerckléVictor MerckléScore: 3,828Success
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 15:363,77839,824,65730,228,0001,130,0002,117,632stderr
2Aug 12, 2026 15:363,78739,820,85930,312,0001,126,0002,117,632stderr
3Aug 12, 2026 15:363,81540,037,81030,602,0001,065,0002,117,632stderr
4Aug 12, 2026 15:363,81840,158,25630,615,0001,078,0002,117,632stderr
5Aug 12, 2026 15:363,82840,132,73030,655,0001,122,0002,117,632stderr
6Aug 12, 2026 15:363,83540,208,98830,767,0001,071,0002,117,632stderr
7Aug 12, 2026 15:363,83940,246,47430,796,0001,068,0002,117,632stderr
8Aug 12, 2026 15:363,84740,337,43530,775,0001,158,0002,117,632stderr
9Aug 12, 2026 15:363,85540,372,86830,924,0001,073,0002,117,632stderr