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 listFeb 28, 2025 05:27NoSIMD_C#NoSIMD_C#Score: 272,743Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 28, 2025 05:27271,332122,820,22258,228,00042,165,0002,473,984
2Feb 28, 2025 05:27272,743133,410,58665,945,00034,970,0002,535,424
3Feb 28, 2025 05:27277,265131,136,63663,363,00039,225,0002,293,760