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 listJan 21, 2025 07:40NoSIMD_C#NoSIMD_C#Score: 276,622Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2025 07:40271,019125,086,15255,152,00045,125,0002,482,176
2Jan 21, 2025 07:40276,622138,786,13758,199,00044,151,0002,293,760
3Jan 21, 2025 07:40277,365129,114,97260,368,00042,257,0002,478,080