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 listNov 29, 2024 08:10NoSIMD_C#NoSIMD_C#Score: 278,400Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 29, 2024 08:10277,119131,320,71523,120,00079,414,0002,289,664
2Nov 29, 2024 08:10278,400128,588,22055,004,00048,004,0002,330,624
3Nov 29, 2024 08:10280,914130,261,46551,969,00051,969,0002,445,312