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 22:11Victor MerckléVictor MerckléScore: 3,959Success
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 22:113,88740,470,47431,163,0001,105,0002,117,632stderr
2Aug 11, 2026 22:113,92641,081,31731,556,0001,031,0002,117,632stderr
3Aug 11, 2026 22:113,92742,125,05831,561,0001,041,0002,117,632stderr
4Aug 11, 2026 22:113,94240,901,29831,671,0001,048,0002,117,632stderr
5Aug 11, 2026 22:113,95941,026,31831,823,0001,044,0002,117,632stderr
6Aug 11, 2026 22:113,98341,524,31331,842,0001,220,0002,117,632stderr
7Aug 11, 2026 22:113,98641,248,79031,927,0001,161,0002,117,632stderr
8Aug 11, 2026 22:114,13742,666,97333,279,0001,065,0002,117,632stderr
9Aug 11, 2026 22:114,19243,874,44333,739,0001,060,0002,117,632stderr