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 listApr 20, 2026 11:55olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Apr 20, 2026 15:49Yuriy Lyfenko10.00CustomSolution Held
Apr 20, 2026 14:53wn10.00RecheckSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 11:5600000
2Apr 20, 2026 21:51010,475,59903,855,0002,531,328expected "53682255170854537 ", got "0 "stderr
3Apr 20, 2026 21:51010,525,60802,789,0002,293,760expected "53686549171415598 ", got "0 "stderr
4Apr 20, 2026 21:51010,519,1641,252,0002,505,0002,289,664expected "53691588635208352 ", got "0 "stderr