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 listFeb 3, 2025 12:14Vladimir EvmenovVladimir EvmenovScore: 1,824,010Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2025 12:141,812,17715,070,704,98414,970,098,00070,967,0002,277,376
2Feb 3, 2025 12:141,822,55715,161,083,99215,060,253,00066,969,0002,277,376
3Feb 3, 2025 12:141,823,10315,161,848,36915,071,783,00059,971,0002,277,376
4Feb 3, 2025 12:141,823,96015,168,892,63215,060,901,00077,968,0002,363,392
5Feb 3, 2025 12:141,824,01015,174,768,96715,069,317,00069,968,0002,277,376
6Feb 3, 2025 12:141,824,36715,174,088,49315,059,293,00082,957,0002,273,280
7Feb 3, 2025 12:141,827,09915,195,042,48615,089,954,00074,969,0002,277,376
8Feb 3, 2025 12:141,836,27915,273,459,54215,188,136,00052,976,0002,269,184
9Feb 3, 2025 12:141,951,75116,234,836,33016,136,563,00062,974,0002,269,184