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 23:59Victor MerckléVictor MerckléScore: 4,458Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2026 00:004,33644,482,86234,885,0001,107,0002,117,632stderr
2Aug 13, 2026 00:004,43645,289,64935,668,0001,158,0002,117,632stderr
3Aug 13, 2026 00:004,44845,218,73135,796,0001,130,0002,117,632stderr
4Aug 13, 2026 00:004,45245,202,77935,866,0001,089,0002,117,632stderr
5Aug 13, 2026 00:004,45845,732,60035,875,0001,132,0002,117,632stderr
6Aug 13, 2026 00:004,45945,472,34835,885,0001,128,0002,117,632stderr
7Aug 13, 2026 00:004,47345,575,07236,028,0001,104,0002,117,632stderr
8Aug 13, 2026 00:004,47545,321,46436,026,0001,120,0002,117,632stderr
9Aug 13, 2026 00:004,81049,019,18738,885,0001,039,0002,117,632stderr