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 listAug 21, 2026 01:23Andrew EpsteinAndrew EpsteinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 10:50Tomislav Tunkovic10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 10:54013,599,2921,848,0001,848,00020,480No answer to stdout. Died or killed?
2Aug 21, 2026 01:234,49947,127,59735,074,0002,274,0002,113,536
3Aug 21, 2026 01:234,50048,575,91635,034,0002,319,0002,113,536
4Aug 21, 2026 01:234,53447,463,92535,342,0002,297,0002,113,536
5Aug 21, 2026 01:234,63348,231,05436,116,0002,340,0002,113,536
6Aug 21, 2026 01:234,66248,467,83536,394,0002,308,0002,113,536
7Aug 21, 2026 01:234,69648,750,98936,667,0002,317,0002,113,536
8Aug 21, 2026 01:234,70548,814,68236,757,0002,295,0002,113,536
9Aug 21, 2026 01:234,70648,883,14036,743,0002,318,0002,113,536
10Aug 21, 2026 01:234,73849,151,61237,132,0002,198,0002,113,536