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 listNov 28, 2024 08:39NoSIMD_C#NoSIMD_C#Score: 277,281Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 28, 2024 08:39276,841126,332,98469,292,00033,139,0002,347,008
2Nov 28, 2024 08:39277,281133,892,88439,227,00063,367,0002,535,424
3Nov 28, 2024 08:39278,686128,936,15964,071,00039,043,0002,523,136