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 16:43NoSIMD_C#NoSIMD_C#Score: 633,362Success
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 16:43631,273268,209,168195,478,00038,093,0002,535,424
2Apr 9, 2025 16:43633,362261,063,654191,281,00043,063,0002,527,232
3Apr 9, 2025 16:43634,073264,858,265202,524,00032,083,0002,478,080