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 11, 2026 18:24Victor MerckléVictor MerckléScore: 3,872Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 11, 2026 18:253,83740,815,87930,698,0001,155,0002,117,632stderr
2Aug 11, 2026 18:253,85240,432,92930,899,0001,080,0002,117,632stderr
3Aug 11, 2026 18:253,85740,393,55330,885,0001,129,0002,117,632stderr
4Aug 11, 2026 18:253,86241,681,56530,929,0001,130,0002,117,632stderr
5Aug 11, 2026 18:253,87240,586,99431,006,0001,139,0002,117,632stderr
6Aug 11, 2026 18:253,87440,603,94531,102,0001,060,0002,117,632stderr
7Aug 11, 2026 18:253,90441,094,04131,378,0001,028,0002,117,632stderr
8Aug 11, 2026 18:254,03341,913,15032,326,0001,149,0002,117,632stderr
9Aug 11, 2026 18:254,10242,448,17733,015,0001,037,0002,117,632stderr