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 listNov 5, 2024 23:26CheranMahalingamCheranMahalingamScore: 1,274,709Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2024 23:261,244,92210,367,944,95410,270,883,00061,969,0002,293,760
2Nov 5, 2024 23:261,267,10910,544,734,35110,442,047,00074,957,0002,281,472
3Nov 5, 2024 23:261,267,48610,550,775,20710,445,172,00074,965,0002,289,664
4Nov 5, 2024 23:261,274,32510,615,080,29510,515,926,00060,970,0002,281,472
5Nov 5, 2024 23:261,274,70910,612,824,17710,514,116,00065,969,0002,293,760
6Nov 5, 2024 23:261,275,33410,616,984,45010,532,294,00052,976,0002,281,472
7Nov 5, 2024 23:261,275,68310,625,573,02010,521,199,00066,969,0002,281,472
8Nov 5, 2024 23:261,276,22210,620,313,03510,505,680,00086,964,0002,281,472
9Nov 5, 2024 23:261,277,26410,633,578,49710,515,327,00085,961,0002,289,664