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:40NoSIMD_C#NoSIMD_C#Score: 592,735Success
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:40588,743248,503,622164,875,00052,960,0002,293,760
2Apr 9, 2025 16:40592,735248,369,787181,258,00038,054,0002,486,272
3Apr 9, 2025 16:40608,411251,463,550186,093,00039,019,0002,293,760