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 23, 2025 08:47NoSIMD_C#NoSIMD_C#Score: 281,446Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2025 08:47280,824127,655,83975,931,00027,974,0002,437,120
2Jan 23, 2025 08:47281,446133,667,21440,052,00064,083,0002,539,520
3Jan 23, 2025 08:47282,162132,410,62646,177,00058,223,0002,347,008