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 03:13Yuriy LyfenkoYuriy LyfenkoError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 04:43Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 04:45053,004,16841,762,0001,017,0002,113,536expected "74600294196621100 ", got "16896501616258860 "
2Jul 7, 2026 04:45053,505,80242,227,0001,017,0002,113,536expected "74600294196621100 ", got "15171790704258860 "
3Jul 7, 2026 04:45053,327,97041,944,0001,017,0002,113,536expected "74600294196621100 ", got "16895846256258860 "
4Mar 18, 2026 03:135,28169,379,34841,838,0001,992,0002,293,760
5Mar 18, 2026 03:135,31071,329,17741,065,0003,004,0002,281,472
6Mar 18, 2026 03:135,43370,423,38043,091,0002,004,0002,387,968