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

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 17:46Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 17:47039,278,22430,189,0001,033,0002,113,536expected "74600294196621100 ", got "74534440031842490 "
2Jul 6, 2026 17:47040,758,25931,486,0001,030,0002,113,536expected "74600294196621100 ", got "74535239978110970 "
3Jul 6, 2026 17:47039,039,48129,628,0001,043,0002,113,536expected "74600294196621100 ", got "74534439617770490 "
4Apr 19, 2026 04:233,71756,721,66028,862,0001,990,0002,486,272
5Apr 19, 2026 04:233,73853,798,96729,023,0002,001,0002,490,368
6Apr 19, 2026 04:233,80556,219,01430,564,0001,018,0002,531,328