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 11, 2025 17:30vahookvahookError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 10:49Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 10:52022,717,37010,664,0002,762,0002,113,536expected "0 ", got "52910917918458776 "
2Sep 9, 2026 10:52067,611,55053,822,0004,454,0002,113,536expected "53668904169729140 ", got "53769663815646163 "
3Sep 9, 2026 10:52068,406,31054,577,0004,427,0002,113,536expected "53666949175381898 ", got "53772001954605933 "
4May 11, 2025 17:307,28691,975,62057,451,0003,023,0002,396,160
5May 11, 2025 17:307,30191,356,40557,570,0003,030,0002,404,352
6May 11, 2025 17:307,30385,497,46157,582,0003,030,0002,408,448
7May 11, 2025 17:307,31889,497,49656,758,0003,983,0002,416,640
8May 11, 2025 17:307,34182,722,96656,932,0003,995,0002,400,256
9May 11, 2025 17:307,40791,008,83558,454,0003,023,0002,527,232