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 26, 2024 06:51NoSIMD_C#NoSIMD_C#Score: 277,786Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 26, 2024 06:51276,962126,028,39055,257,00047,219,0002,539,520
2Nov 26, 2024 06:51277,786129,031,98455,881,00046,900,0002,506,752
3Nov 26, 2024 06:51282,003131,179,40261,200,00043,141,0002,506,752