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 4, 2021 22:24Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 5, 2026 05:59Tomislav Tunkovic42.32CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2026 06:210222,255,228197,163,00015,085,00016,384No answer to stdout. Died or killed?
2May 4, 2021 22:2423,598220,695,152194,868,000999,0002,260,992
3May 4, 2021 22:2423,613231,268,734194,990,000999,0002,260,992
4May 4, 2021 22:2423,617220,964,949194,022,0002,000,0002,260,992
5May 4, 2021 22:2423,632219,140,969195,142,0001,000,0002,396,160
6May 4, 2021 22:2423,632219,749,543192,145,0004,003,0002,396,160
7May 4, 2021 22:2423,634227,135,827193,160,0003,002,0002,260,992
8May 4, 2021 22:2423,641226,040,594194,218,0002,002,0002,482,176
9May 4, 2021 22:2423,644225,234,985195,241,0001,001,0002,260,992
10May 4, 2021 22:2423,655221,969,739194,332,0002,003,0002,392,064