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 listMar 20, 2026 00:35olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:56Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:56049,100,64237,524,0002,018,0002,117,632expected "74600294196621100 ", got "47057772138707244 "
2Jul 7, 2026 05:56049,178,23937,518,0002,108,0002,117,632expected "74600294196621100 ", got "47052762415095084 "
3Jul 7, 2026 05:56049,392,60537,790,0002,009,0002,117,632expected "74600294196621100 ", got "46977450136477740 "
4Mar 20, 2026 00:355,78970,666,41543,043,0005,005,0002,494,464
5Mar 20, 2026 00:355,80373,837,93145,159,0003,010,0002,482,176
6Mar 20, 2026 00:355,84070,659,64246,450,0002,019,0002,486,272