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 26, 2026 20:51Victor MerckléVictor MerckléScore: 4,073Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 26, 2026 20:523,92140,948,39731,332,0001,213,0002,117,632stderr
2Aug 26, 2026 20:523,92940,967,41231,467,0001,148,0002,117,632stderr
3Aug 26, 2026 20:523,98341,451,30331,884,0001,181,0002,117,632stderr
4Aug 26, 2026 20:523,99142,948,03231,992,0001,135,0002,117,632stderr
5Aug 26, 2026 20:524,07341,947,62832,690,0001,122,0002,117,632stderr
6Aug 26, 2026 20:524,17643,708,19833,613,0001,055,0002,117,632stderr
7Aug 26, 2026 20:524,20043,285,85233,788,0001,077,0002,117,632stderr
8Aug 26, 2026 20:524,22943,366,57433,981,0001,120,0002,117,632stderr
9Aug 26, 2026 20:524,40057,083,71635,335,0001,192,0002,117,632stderr