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 listNov 28, 2024 08:43NoSIMD_C#NoSIMD_C#Score: 277,119Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 28, 2024 08:43276,727127,782,33284,321,00018,068,0002,535,424
2Nov 28, 2024 08:43276,962127,416,42886,402,00016,074,0002,355,200
3Nov 28, 2024 08:43277,011130,158,09545,218,00057,276,0002,535,424
4Nov 28, 2024 08:43277,111127,241,05145,234,00057,297,0002,330,624
5Nov 28, 2024 08:43277,119130,760,87199,519,0003,015,0002,347,008
6Nov 28, 2024 08:43277,457131,157,06148,310,00054,349,0002,535,424
7Nov 28, 2024 08:43278,243130,190,89533,983,00068,967,0002,342,912
8Nov 28, 2024 08:43278,332131,239,23562,990,00039,993,0002,338,816
9Nov 28, 2024 08:43278,573129,683,19160,042,00043,030,0002,482,176