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 listJul 22, 2026 16:29Kevin HeaveyKevin HeaveyScore: 3,560Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Sep 4, 2026 14:37Tomislav Tunkovic10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 16:303,53438,988,66428,247,0001,086,0002,113,536
2Jul 22, 2026 16:303,54039,065,68928,258,0001,126,0002,113,536
3Jul 22, 2026 16:303,55139,143,02328,363,0001,113,0002,113,536
4Jul 22, 2026 16:303,55739,239,72328,405,0001,123,0002,113,536
5Jul 22, 2026 16:303,56043,333,99228,444,0001,109,0002,113,536
6Jul 22, 2026 16:303,56339,267,58328,496,0001,085,0002,113,536
7Jul 22, 2026 16:303,58039,420,68828,544,0001,173,0002,113,536
8Jul 22, 2026 16:303,68740,383,52329,490,0001,120,0002,113,536
9Jul 22, 2026 16:303,85141,723,84430,795,0001,174,0002,113,536