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 9, 2025 11:52NoSIMD_C#NoSIMD_C#Score: 325,241Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2025 11:52323,119148,038,48176,354,00043,200,0002,293,760
2Apr 9, 2025 11:52325,241148,537,31274,209,00046,130,0002,535,424
3Apr 9, 2025 11:52327,962148,664,34473,209,00048,137,0002,322,432