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 20, 2026 12:06wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 20:26Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 20:26040,616,21231,745,0001,001,0002,113,536expected "74600294196621100 ", got "74924921685025778 "
2Jul 6, 2026 20:26046,203,88933,846,0001,067,0002,113,536expected "74600294196621100 ", got "74594612787305467 "
3Jul 6, 2026 20:26041,864,01632,885,0001,008,0002,113,536expected "74600294196621100 ", got "74594491580751477 "
4Apr 20, 2026 12:064,11551,512,51232,148,0002,009,0002,457,600
5Apr 20, 2026 12:064,12657,070,59833,245,0001,007,0002,465,792
6Apr 20, 2026 12:064,26046,394,35433,345,0002,020,0002,256,896