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 29, 2024 06:12NoSIMD_C#NoSIMD_C#Score: 350,797Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 29, 2024 06:12348,684158,136,95085,009,00044,004,0002,347,008
2Nov 29, 2024 06:12350,797156,596,89986,863,00042,932,0002,355,200
3Nov 29, 2024 06:12355,700156,332,64181,377,00050,232,0002,293,760