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 listMay 22, 2025 12:30Parinay ChauhanParinay ChauhanScore: 367,832Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2025 12:30366,8843,068,915,6482,959,189,00085,947,0002,510,848
2May 22, 2025 12:30366,9253,069,879,2312,960,518,00084,957,0002,289,664
3May 22, 2025 12:30367,1123,072,142,0902,976,076,00070,954,0002,289,664
4May 22, 2025 12:30367,2483,072,323,2142,980,203,00067,959,0002,281,472
5May 22, 2025 12:30367,8323,080,075,7362,986,053,00066,956,0002,510,848
6May 22, 2025 12:30368,2173,080,383,0122,988,243,00067,960,0002,289,664
7May 22, 2025 12:30368,7663,090,281,8622,976,794,00083,966,0002,506,752
8May 22, 2025 12:30369,4573,089,852,3792,995,530,00070,965,0002,289,664
9May 22, 2025 12:30371,2663,106,386,5213,014,539,00066,967,0002,289,664