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 listApr 22, 2026 05:55wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 22:21Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 22:21041,289,21732,458,0001,018,0002,113,536expected "74600294196621100 ", got "74924881664771128 "
2Jul 6, 2026 22:21041,727,03932,709,0001,033,0002,113,536expected "74600294196621100 ", got "74924972293550798 "
3Jul 6, 2026 22:21042,203,75632,586,0001,037,0002,117,632expected "74600294196621100 ", got "74924820867150728 "
4Apr 22, 2026 05:554,20351,057,58232,895,0001,993,0002,330,624
5Apr 22, 2026 05:554,25649,832,67034,322,0001,009,0002,555,904
6Apr 22, 2026 05:554,37651,422,23035,315,0001,009,0002,486,272