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 21:43Mikołaj UzarskiMikołaj UzarskiError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 21:31Adam Folwarczny10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 21:31049,775,39638,998,0001,018,0002,113,536expected "27617841214539459 ", got "144249530311770939 "
2Jul 7, 2026 21:31049,530,74238,824,0001,017,0002,113,536expected "27617841214539459 ", got "144249530311770939 "
3Jul 7, 2026 21:31049,502,51338,742,0001,018,0002,113,536expected "27617841214539459 ", got "144249530311770939 "
4Feb 26, 2026 21:435,13168,191,17741,574,0001,014,0002,396,160
5Feb 26, 2026 21:435,16072,382,21539,837,0002,987,0002,392,064
6Feb 26, 2026 21:435,16473,029,83640,821,0002,041,0002,293,760