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 10, 2026 08:30Josu San MartinJosu San MartinScore: 4,091Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2026 08:304,05647,827,95832,573,0001,095,0002,478,080
2May 10, 2026 08:304,07346,164,14632,719,0001,088,0002,482,176
3May 10, 2026 08:304,08251,674,96232,723,0001,162,0002,482,176
4May 10, 2026 08:304,08749,378,77332,813,0001,114,0002,486,272
5May 10, 2026 08:304,09148,650,17332,788,0001,169,0002,482,176
6May 10, 2026 08:304,09649,930,45132,849,0001,154,0002,486,272
7May 10, 2026 08:304,10049,309,83433,003,0001,034,0002,482,176
8May 10, 2026 08:304,11248,989,68033,089,0001,041,0002,482,176
9May 10, 2026 08:304,12052,231,69733,137,0001,060,0002,482,176