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:14olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 05:49Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 05:50051,620,31840,968,0001,056,0002,117,632expected "74600294196621100 ", got "36687656464993324 "
2Jul 7, 2026 05:50051,413,37640,796,0001,028,0002,117,632expected "74600294196621100 ", got "36673824047067948 "
3Jul 7, 2026 05:50050,395,69338,557,0002,216,0002,117,632expected "74600294196621100 ", got "47054206531225388 "
4Mar 20, 2026 00:145,78971,977,33646,049,0002,002,0002,506,752
5Mar 20, 2026 00:145,79669,522,66646,106,0002,004,0002,318,336
6Mar 20, 2026 00:145,85974,440,61447,620,0001,013,0002,510,848