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 9, 2025 16:15NoSIMD_C#NoSIMD_C#Score: 277,527Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2025 16:15277,054124,985,41361,305,00041,205,0002,297,856
2Apr 9, 2025 16:15277,527127,635,25274,497,00028,188,0002,375,680
3Apr 9, 2025 16:15285,057133,446,49755,247,00050,224,0002,301,952