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 listMar 17, 2026 08:40limanjun99limanjun99Score: 10,609Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 08:4010,593110,432,46985,927,0001,998,0002,494,464
2Mar 17, 2026 08:4010,595114,964,58485,940,0001,998,0002,289,664
3Mar 17, 2026 08:4010,602110,294,36586,000,0002,000,0002,289,664
4Mar 17, 2026 08:4010,607111,883,88086,037,0002,000,0002,490,368
5Mar 17, 2026 08:4010,609113,385,79186,053,0002,001,0002,289,664
6Mar 17, 2026 08:4010,614115,933,89186,094,0002,002,0002,494,464
7Mar 17, 2026 08:4010,617119,471,97285,120,0003,004,0002,498,560
8Mar 17, 2026 08:4010,629121,315,53186,215,0002,005,0002,494,464
9Mar 17, 2026 08:4010,671112,598,61587,560,0001,006,0002,494,464