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 21, 2026 07:19olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:28Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:29048,855,66237,210,0002,061,0002,117,632expected "74600294196621100 ", got "35710587685239852 "
2Jul 7, 2026 05:29046,702,40136,007,0001,030,0002,117,632expected "74600294196621100 ", got "36631424875518764 "
3Jul 7, 2026 05:29047,776,56437,190,0001,025,0002,117,632expected "74600294196621100 ", got "53559116252183340 "
4Mar 21, 2026 07:195,65472,633,96143,935,0002,995,0002,465,792
5Mar 21, 2026 07:195,69677,447,83544,260,0003,017,0002,445,312
6Mar 21, 2026 07:195,74077,985,49843,587,0004,054,0002,404,352