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 13, 2026 21:41Victor MerckléVictor MerckléScore: 71,400Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 21:4271,353599,986,319591,126,0001,108,0002,117,632stderr
2May 13, 2026 21:4271,363601,608,536591,315,0001,001,0002,117,632stderr
3May 13, 2026 21:4271,370600,248,777591,315,0001,061,0002,117,632stderr
4May 13, 2026 21:4271,389602,356,558591,428,0001,105,0002,117,632stderr
5May 13, 2026 21:4271,400601,877,464591,504,0001,120,0002,117,632stderr
6May 13, 2026 21:4271,429601,008,014591,819,0001,046,0002,117,632stderr
7May 13, 2026 21:4271,454602,384,611591,965,0001,107,0002,117,632stderr
8May 13, 2026 21:4271,471602,767,923592,084,0001,127,0002,117,632stderr
9May 13, 2026 21:4271,491601,368,227592,362,0001,020,0002,117,632stderr