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 23, 2025 08:49NoSIMD_C#NoSIMD_C#Score: 208,686Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2025 08:49208,576102,822,01976,171,0001,002,0002,531,328
2Apr 23, 2025 08:49208,686109,163,02575,209,0002,005,0002,301,952
3Apr 23, 2025 08:49208,884105,109,67575,280,0002,007,0002,535,424