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 listMay 14, 2026 21:44Victor MerckléVictor MerckléScore: 126,797Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 21:45126,1411,055,813,1311,045,971,0001,001,0002,117,632stderr
2May 14, 2026 21:45126,2521,056,071,3331,046,890,0001,002,0002,117,632stderr
3May 14, 2026 21:45126,4901,057,758,2101,048,865,0001,002,0002,117,632stderr
4May 14, 2026 21:45126,7171,059,097,8331,050,754,0001,002,0002,117,632stderr
5May 14, 2026 21:45126,7971,060,263,3891,051,422,0001,000,0002,117,632stderr
6May 14, 2026 21:45126,8981,062,669,2291,052,256,0001,002,0002,117,632stderr
7May 14, 2026 21:45126,9011,060,784,6071,052,285,0001,000,0002,117,632stderr
8May 14, 2026 21:45126,9061,063,549,6761,052,324,0001,002,0002,117,632stderr
9May 14, 2026 21:45127,2481,063,613,7731,055,164,0001,001,0002,117,632stderr