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 18, 2026 20:19wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 21:39Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 21:39041,312,44032,183,0001,007,0002,113,536expected "74600294196621100 ", got "73950010134989100 "
2Jul 6, 2026 21:39040,594,09031,416,0001,096,0002,113,536expected "74600294196621100 ", got "73955365256683820 "
3Jul 6, 2026 21:39042,211,07531,589,0001,128,0002,113,536expected "74600294196621100 ", got "73949657142384940 "
4Mar 18, 2026 20:194,23457,639,93333,135,0002,008,0002,490,368
5Mar 18, 2026 20:194,23862,614,84633,167,0002,010,0002,273,280
6Mar 18, 2026 20:194,24761,285,51633,232,0002,014,0002,498,560