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 listApr 5, 2025 19:05NoSIMD_C#NoSIMD_C#Score: 275,105Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 5, 2025 19:05272,441132,753,23657,887,00042,916,0002,535,424
2Apr 5, 2025 19:05275,105128,032,18162,870,00038,919,0002,535,424
3Apr 5, 2025 19:05276,068128,116,08557,081,00045,064,0002,535,424