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 13, 2025 09:47Dok OktavoDok OktavoScore: 370,188Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2025 09:47368,0033,079,124,0993,001,451,00052,972,0002,347,008
2Oct 13, 2025 09:47368,4433,085,207,4792,992,099,00065,980,0002,281,472
3Oct 13, 2025 09:47368,9883,089,724,6072,996,634,00065,969,0002,351,104
4Oct 13, 2025 09:47369,6323,100,172,4343,003,967,00063,978,0002,281,472
5Oct 13, 2025 09:47370,1883,095,895,7902,989,599,00082,961,0002,281,472
6Oct 13, 2025 09:47370,2713,104,771,8593,007,287,00065,962,0002,285,568
7Oct 13, 2025 09:47370,4343,102,801,1363,004,633,00069,968,0002,281,472
8Oct 13, 2025 09:47370,9863,101,228,6353,017,217,00061,963,0002,285,568
9Oct 13, 2025 09:47371,2023,110,739,5773,003,027,00077,948,0002,285,568