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 19, 2026 06:18wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 19:56Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 19:56043,492,88534,541,0001,003,0002,113,536expected "74600294196621100 ", got "74535239987179300 "
2Jul 6, 2026 19:56043,859,14234,772,0001,028,0002,113,536expected "74600294196621100 ", got "74535240126320970 "
3Jul 6, 2026 19:56041,498,72132,482,0001,009,0002,113,536expected "74600294196621100 ", got "74833083347217073 "
4Apr 19, 2026 06:184,04756,029,47432,569,0001,017,0002,277,376
5Apr 19, 2026 06:184,07863,668,35632,850,000995,0002,523,136
6Apr 19, 2026 06:184,23954,304,67233,176,0002,010,0002,494,464