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 listJul 14, 2026 17:53Andrew TsibinAndrew TsibinError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 9, 2026 10:41Tomislav Tunkovic152.99CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 9, 2026 10:420219,432,938206,809,0001,075,0002,113,536expected "53663184351293291 ", got "53662963213165524 "
2Sep 9, 2026 10:42030,031,604,22230,017,748,0002,009,00016,384Killed by timeout
3Jul 14, 2026 17:534,90550,941,04839,584,0001,133,0002,113,536
4Jul 14, 2026 17:534,91050,413,80139,656,0001,105,0002,113,536
5Jul 14, 2026 17:534,92451,087,90239,762,0001,113,0002,113,536
6Jul 14, 2026 17:534,94950,694,06040,071,0001,010,0002,113,536
7Jul 14, 2026 17:534,95351,401,39440,011,0001,106,0002,113,536
8Jul 14, 2026 17:534,95551,663,64840,047,0001,080,0002,113,536
9Jul 14, 2026 17:534,95650,768,44840,052,0001,086,0002,113,536
10Jul 14, 2026 17:534,96450,919,75040,086,0001,119,0002,113,536
11Jul 14, 2026 17:535,00055,345,28240,398,0001,107,0002,113,536