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 4, 2026 00:23zielajzielajScore: 3,320Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Jul 7, 2026 21:32Adam Folwarczny10.00CustomSolution Held
Jul 4, 2026 00:28Victor Mercklé10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 00:243,31035,517,78726,341,0001,132,0002,113,536
2Jul 4, 2026 00:243,31335,422,33926,457,0001,046,0002,113,536
3Jul 4, 2026 00:243,31535,501,20426,479,0001,038,0002,113,536
4Jul 4, 2026 00:243,31635,530,11026,422,0001,104,0002,113,536
5Jul 4, 2026 00:243,32035,370,23226,510,0001,052,0002,113,536
6Jul 4, 2026 00:243,39336,082,85027,126,0001,038,0002,113,536
7Jul 4, 2026 00:243,40936,278,78727,246,0001,053,0002,113,536
8Jul 4, 2026 00:243,50237,018,82628,016,0001,052,0002,113,536
9Jul 4, 2026 00:2461,956522,223,960513,165,0001,070,0002,113,536