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:01Victor MerckléVictor MerckléScore: 3,802Success
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:023,76439,709,06730,081,0001,168,0002,117,632stderr
2Aug 12, 2026 01:023,76939,714,82030,208,0001,077,0002,117,632stderr
3Aug 12, 2026 01:023,78439,723,09030,259,0001,154,0002,117,632stderr
4Aug 12, 2026 01:023,79439,874,72830,394,0001,100,0002,117,632stderr
5Aug 12, 2026 01:023,80239,953,09030,428,0001,132,0002,117,632stderr
6Aug 12, 2026 01:023,81040,146,31730,490,0001,133,0002,117,632stderr
7Aug 12, 2026 01:023,81640,105,17830,524,0001,153,0002,117,632stderr
8Aug 12, 2026 01:023,86540,520,83231,022,0001,064,0002,117,632stderr
9Aug 12, 2026 01:023,94641,154,42731,706,0001,053,0002,117,632stderr