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 listApr 9, 2025 16:32NoSIMD_C#NoSIMD_C#Score: 272,681Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 9, 2025 16:32272,500132,366,82366,884,00033,941,0002,535,424
2Apr 9, 2025 16:32272,681131,241,17356,939,00043,953,0002,441,216
3Apr 9, 2025 16:32280,611130,009,40859,900,00043,926,0002,445,312