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 29, 2024 08:01NoSIMD_C#NoSIMD_C#Score: 280,441Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 29, 2024 08:01276,908125,932,93389,398,00013,058,0002,535,424
2Nov 29, 2024 08:01280,441133,496,71767,845,00035,918,0002,293,760
3Nov 29, 2024 08:01280,562132,867,56556,895,00046,913,0002,293,760