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 08:41Victor MerckléVictor MerckléScore: 67,562Success
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 08:4167,551567,992,548559,615,0001,060,0002,117,632stderr
2May 14, 2026 08:4167,552568,116,984559,559,0001,124,0002,117,632stderr
3May 14, 2026 08:4167,552570,018,562559,608,0001,080,0002,117,632stderr
4May 14, 2026 08:4167,553568,619,087559,623,0001,073,0002,117,632stderr
5May 14, 2026 08:4167,562567,992,819559,733,0001,034,0002,117,632stderr
6May 14, 2026 08:4167,576571,207,107559,743,0001,141,0002,117,632stderr
7May 14, 2026 08:4167,584568,530,583559,916,0001,039,0002,117,632stderr
8May 14, 2026 08:4167,600569,803,917560,013,0001,067,0002,117,632stderr
9May 14, 2026 08:4167,630571,504,624560,183,0001,150,0002,117,632stderr