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 27, 2026 17:38Victor MerckléVictor MerckléScore: 3,882Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 27, 2026 17:393,78939,877,71230,256,0001,195,0002,117,632
2Aug 27, 2026 17:393,82340,787,61430,541,0001,192,0002,117,632
3Aug 27, 2026 17:393,84540,387,29830,768,0001,147,0002,117,632
4Aug 27, 2026 17:393,86040,998,38430,829,0001,211,0002,117,632
5Aug 27, 2026 17:393,88240,672,68631,092,0001,129,0002,117,632
6Aug 27, 2026 17:393,89940,748,01831,245,0001,124,0002,117,632
7Aug 27, 2026 17:393,92240,963,54031,523,0001,031,0002,117,632
8Aug 27, 2026 17:393,94447,283,01731,468,0001,268,0002,117,632
9Aug 27, 2026 17:394,07142,121,13032,667,0001,125,0002,117,632