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:12NoSIMD_C#NoSIMD_C#Score: 168,043Success
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:12167,88990,872,33861,118,0001,001,0002,543,616
2Apr 22, 2025 10:12168,04392,500,85361,174,0001,002,0002,535,424
3Apr 22, 2025 10:12168,36289,526,21661,290,0001,004,0002,531,328