TopK Sergey Svistunov

Find the sum of the 100 largest values in a stream of binary integers as fast as possible.

Input: 100 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: The uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listJan 22, 2025 23:27Oleg KovalovOleg KovalovScore: 356,608Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2025 23:27354,384158,173,35986,080,00045,042,0002,281,472
2Jan 22, 2025 23:27354,670162,072,86384,146,00047,082,0002,281,472
3Jan 22, 2025 23:27354,681155,027,79890,160,00041,072,0002,289,664
4Jan 22, 2025 23:27354,762158,943,67884,168,00047,094,0002,289,664
5Jan 22, 2025 23:27356,608162,839,853107,955,00023,990,0002,289,664
6Jan 22, 2025 23:27356,616159,158,75773,971,00057,977,0002,277,376
7Jan 22, 2025 23:27356,722158,280,66882,992,00048,995,0002,502,656
8Jan 22, 2025 23:27356,776157,365,58391,005,00041,002,0002,506,752
9Jan 22, 2025 23:27357,068154,673,89987,076,00045,039,0002,289,664