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 07:22NoSIMD_C#NoSIMD_C#Score: 299,749Success
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 07:22297,608136,030,37361,064,00049,051,0002,498,560
2Nov 29, 2024 07:22299,749143,640,30660,949,00049,958,0002,490,368
3Nov 29, 2024 07:22302,195137,770,75464,891,00046,921,0002,523,136