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 06:19Josu San MartinJosu San MartinScore: 4,570Success
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 06:204,55852,517,44036,697,0001,140,0002,486,272
2May 10, 2026 06:204,56454,240,01236,842,0001,040,0002,490,368
3May 10, 2026 06:204,56656,248,92336,870,0001,030,0002,494,464
4May 10, 2026 06:204,56956,249,40536,799,0001,129,0002,490,368
5May 10, 2026 06:204,57053,222,60636,828,0001,104,0002,486,272
6May 10, 2026 06:204,57353,153,17036,929,0001,034,0002,486,272
7May 10, 2026 06:204,61455,399,48237,270,0001,034,0002,482,176
8May 10, 2026 06:204,67658,130,76537,694,0001,119,0002,490,368
9May 10, 2026 06:208,03383,171,05165,652,0001,030,0002,486,272