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 20, 2026 12:23wnwnError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 6, 2026 17:28Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2026 17:28035,535,12426,578,0001,028,0002,113,536expected "74600294196621100 ", got "74924963304506118 "
2Jul 6, 2026 17:28037,406,50028,486,0001,037,0002,113,536expected "74600294196621100 ", got "74594495117833467 "
3Jul 6, 2026 17:28035,523,27926,724,0001,023,0002,113,536expected "74600294196621100 ", got "74924920067168928 "
4Apr 20, 2026 12:263,56650,252,50628,586,0001,020,0002,457,600
5Apr 20, 2026 12:263,60053,400,05228,855,0001,030,0002,465,792
6Apr 20, 2026 12:263,60356,637,12527,917,0001,994,0002,465,792