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 listMay 23, 2025 12:05vahookvahookError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 02:35Victor Mercklé10.00CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2026 02:37040,864,61531,733,0001,028,0002,113,536expected "74600294196621100 ", got "45841375015023077 "
2Jul 7, 2026 02:37040,866,08631,686,0001,033,0002,113,536expected "74600294196621100 ", got "46425059381294892 "
3Jul 7, 2026 02:37040,857,51930,867,0002,037,0002,113,536expected "74600294196621100 ", got "46425059381294892 "
4May 23, 2025 12:054,52063,008,65134,472,0003,041,0002,273,280
5May 23, 2025 12:054,53969,345,92732,580,0005,090,0002,273,280
6May 23, 2025 12:054,54367,041,23034,650,0003,057,0002,273,280
7May 23, 2025 12:054,56961,855,81033,931,0003,991,0002,420,736
8May 23, 2025 12:054,67864,761,14733,849,0004,977,0002,424,832
9May 23, 2025 12:054,68067,610,17734,857,0003,983,0002,273,280