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:38NoSIMD_C#NoSIMD_C#Score: 278,132Success
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:38278,095127,184,7500102,895,0002,535,424
2Nov 28, 2024 08:38278,132127,701,7589,991,00092,918,0002,535,424
3Nov 28, 2024 08:38279,341131,186,95061,211,00042,145,0002,498,560