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 26, 2024 08:23NoSIMD_C#NoSIMD_C#Score: 280,557Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 26, 2024 08:23278,892130,569,42092,170,00011,020,0002,539,520
2Nov 26, 2024 08:23280,557133,543,54878,853,00024,953,0002,539,520
3Nov 26, 2024 08:23281,465129,862,88866,090,00038,052,0002,539,520