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

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 18:49Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 18:49040,412,61631,392,0001,002,0002,113,536expected "74600294196621100 ", got "74534896735897900 "
2Jul 6, 2026 18:49042,212,87333,213,0001,044,0002,113,536expected "74600294196621100 ", got "74534440254671170 "
3Jul 6, 2026 18:49041,114,75732,059,0001,043,0002,113,536expected "74600294196621100 ", got "74534440884707170 "
4Apr 19, 2026 03:304,07656,162,67331,844,0001,990,0002,531,328
5Apr 19, 2026 03:304,07758,757,83431,850,0001,990,0002,531,328
6Apr 19, 2026 03:304,09156,842,39631,961,0001,997,0002,277,376