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 listFeb 26, 2026 20:22Mikołaj UzarskiMikołaj UzarskiError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 21:52Adam Folwarczny10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 21:54049,804,39039,004,0001,017,0002,113,536expected "27617841214539459 ", got "144249530311770939 "
2Jul 7, 2026 21:54049,031,65438,364,0001,016,0002,113,536expected "27617841214539459 ", got "144249530311770939 "
3Jul 7, 2026 21:54049,909,88439,163,0001,018,0002,113,536expected "27617841214539459 ", got "144249530311770939 "
4Feb 26, 2026 20:225,15769,243,43139,820,0002,986,0002,293,760
5Feb 26, 2026 20:225,16367,680,11839,861,0002,989,0002,400,256
6Feb 26, 2026 20:225,16671,606,61740,880,0001,994,0002,396,160