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 03:46wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 21:41Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 21:43043,675,81634,529,0001,012,0002,113,536expected "74600294196621100 ", got "74535239564179300 "
2Jul 6, 2026 21:43040,797,03531,620,0001,036,0002,113,536expected "74600294196621100 ", got "74534439887806490 "
3Jul 6, 2026 21:43040,943,56831,889,0001,005,0002,113,536expected "74600294196621100 ", got "74534440902617170 "
4Apr 19, 2026 03:464,08157,149,50231,884,0001,992,0002,490,368
5Apr 19, 2026 03:464,24458,632,14733,214,0002,013,0002,486,272
6Apr 19, 2026 03:464,50759,140,23936,394,0001,010,0002,482,176