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 5, 2026 00:01olliecrowolliecrowScore: 6,990Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 5, 2026 00:046,83574,498,27254,402,0002,334,0002,482,176
2May 5, 2026 00:046,85273,704,73654,576,0002,301,0002,437,120
3May 5, 2026 00:046,86277,964,91354,658,0002,297,0002,535,424
4May 5, 2026 00:046,90774,442,57255,061,0002,273,0002,486,272
5May 5, 2026 00:046,99074,344,55255,740,0002,279,0002,437,120
6May 5, 2026 00:047,01676,280,00555,932,0002,301,0002,494,464
7May 5, 2026 00:047,02184,560,25156,003,0002,273,0002,490,368
8May 5, 2026 00:047,03273,632,62456,117,0002,254,0002,535,424
9May 5, 2026 00:047,06675,687,43856,330,0002,321,0002,535,424