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 listOct 27, 2025 07:55Weitao WanWeitao WanScore: 41,226Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 27, 2025 07:5541,205365,195,239340,005,0002,000,0002,265,088
2Oct 27, 2025 07:5541,210366,338,891340,039,0002,000,0002,531,328
3Oct 27, 2025 07:5541,212368,641,265340,060,0002,000,0002,285,568
4Oct 27, 2025 07:5541,213365,757,760341,068,0001,000,0002,285,568
5Oct 27, 2025 07:5541,226364,296,438340,176,0002,001,0002,285,568
6Oct 27, 2025 07:5541,231364,279,686340,213,0002,001,0002,285,568
7Oct 27, 2025 07:5541,240370,350,853341,289,0001,000,0002,285,568
8Oct 27, 2025 07:5541,245368,738,963341,337,0001,000,0002,285,568
9Oct 27, 2025 07:5542,566376,609,067352,300,0001,000,0002,371,584