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 13, 2026 10:39wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 22:56Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 22:56043,233,43333,534,0001,059,0002,113,536expected "74600294196621100 ", got "74268942855850028 "
2Jul 6, 2026 22:56040,563,30630,129,0001,116,0002,113,536expected "74600294196621100 ", got "72474885006964524 "
3Jul 6, 2026 22:56039,472,25229,727,0001,098,0002,113,536expected "74600294196621100 ", got "71620804215429420 "
4Apr 13, 2026 10:394,08364,350,22331,894,0001,993,0002,277,376
5Apr 13, 2026 10:394,27159,119,88634,440,0001,012,0002,498,560
6Apr 13, 2026 10:394,31866,624,24933,846,0001,990,0002,494,464