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 03:32Victor MerckléVictor MerckléScore: 4,182Success
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 03:334,12042,345,99333,050,0001,148,0002,117,632stderr
2Aug 27, 2026 03:334,13042,540,09233,151,0001,132,0002,117,632stderr
3Aug 27, 2026 03:334,16444,329,89233,483,0001,084,0002,117,632stderr
4Aug 27, 2026 03:334,17043,268,31533,421,0001,190,0002,117,632stderr
5Aug 27, 2026 03:334,18243,023,46633,626,0001,088,0002,117,632stderr
6Aug 27, 2026 03:334,18242,920,61633,584,0001,131,0002,117,632stderr
7Aug 27, 2026 03:334,20343,157,68333,789,0001,096,0002,117,632stderr
8Aug 27, 2026 03:334,20843,279,19033,754,0001,178,0002,117,632stderr
9Aug 27, 2026 03:334,45445,165,81735,943,0001,032,0002,117,632stderr