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 03:52NoSIMD_C#NoSIMD_C#Score: 351,059Success
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 03:52349,257161,190,76186,150,00043,075,0002,342,912
2Nov 29, 2024 03:52351,059155,163,26375,937,00053,955,0002,535,424
3Nov 29, 2024 03:52352,003158,009,29484,156,00046,085,0002,543,616