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 15, 2026 18:45Victor MerckléVictor MerckléScore: 87,141Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 15, 2026 18:4586,643728,141,800658,737,00060,406,0002,121,728stderr
2May 15, 2026 18:4586,854728,972,481658,624,00062,269,0002,121,728stderr
3May 15, 2026 18:4586,879729,209,678659,457,00061,642,0002,121,728stderr
4May 15, 2026 18:4587,110732,363,459659,452,00063,568,0002,121,728stderr
5May 15, 2026 18:4587,141732,026,382660,095,00063,181,0002,121,728stderr
6May 15, 2026 18:4587,200733,007,456660,842,00062,920,0002,121,728stderr
7May 15, 2026 18:4587,457733,740,933664,016,00061,882,0002,121,728stderr
8May 15, 2026 18:4587,547736,123,981665,426,00061,218,0002,121,728stderr
9May 15, 2026 18:4587,657735,789,326665,736,00061,823,0002,121,728stderr