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 3, 2026 17:00Josu San MartinJosu San MartinScore: 38,049Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 17:0738,040325,198,920314,727,0001,005,0002,113,536
2Jul 3, 2026 17:0738,042325,200,945314,748,0001,004,0002,113,536
3Jul 3, 2026 17:0738,044325,586,861314,765,0001,007,0002,113,536
4Jul 3, 2026 17:0738,046325,261,481314,781,0001,004,0002,113,536
5Jul 3, 2026 17:0738,049325,187,476314,808,0001,003,0002,113,536
6Jul 3, 2026 17:0738,049325,212,287314,809,0001,004,0002,113,536
7Jul 3, 2026 17:0738,051325,223,206314,824,0001,004,0002,113,536
8Jul 3, 2026 17:0738,055325,241,235314,859,0001,005,0002,113,536
9Jul 3, 2026 17:0738,055325,206,114314,852,0001,005,0002,113,536