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 30, 2025 04:51Dmitrii KopeikinDmitrii KopeikinScore: 369,870Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 30, 2025 04:51368,0103,082,012,2683,000,509,00053,973,0002,281,472
2Oct 30, 2025 04:51368,1413,080,705,1883,004,596,00050,976,0002,359,296
3Oct 30, 2025 04:51368,8453,087,056,2432,998,449,00062,967,0002,281,472
4Oct 30, 2025 04:51369,3503,097,319,8372,995,636,00069,968,0002,281,472
5Oct 30, 2025 04:51369,8703,097,723,3643,006,967,00062,957,0002,281,472
6Oct 30, 2025 04:51369,9843,094,712,4072,997,892,00072,973,0002,347,008
7Oct 30, 2025 04:51370,4603,099,991,9483,013,845,00060,976,0002,281,472
8Oct 30, 2025 04:51371,1243,107,687,7303,013,366,00066,963,0002,355,200
9Oct 30, 2025 04:51371,4593,113,185,2413,013,149,00069,957,0002,281,472