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 22, 2025 10:38NoSIMD_C#NoSIMD_C#Score: 167,978Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 22, 2025 10:38167,15790,934,10060,851,000997,0002,301,952
2Apr 22, 2025 10:38167,97887,860,87459,145,0003,007,0002,301,952
3Apr 22, 2025 10:38167,98692,701,77260,150,0002,005,0002,301,952