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 20, 2026 22:15Andrew EpsteinAndrew EpsteinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 10:55Tomislav Tunkovic63.84CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 11:00011,017,0111,151,000020,480No answer to stdout. Died or killed?
2Aug 20, 2026 22:155,99659,591,75848,719,0001,051,0002,113,536
3Aug 20, 2026 22:156,01659,690,85348,882,0001,054,0002,113,536
4Aug 20, 2026 22:156,04159,911,66349,081,0001,063,0002,113,536
5Aug 20, 2026 22:156,06361,255,57649,267,0001,059,0002,113,536
6Aug 20, 2026 22:156,12960,699,27849,807,0001,065,0002,113,536
7Aug 20, 2026 22:156,15060,709,28049,995,0001,055,0002,113,536
8Aug 20, 2026 22:156,19961,223,04750,398,0001,058,0002,113,536
9Aug 20, 2026 22:156,21061,290,40050,487,0001,062,0002,113,536
10Aug 20, 2026 22:156,22461,493,81650,609,0001,056,0002,113,536