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 17:53NoSIMD_C#NoSIMD_C#Score: 271,432Success
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 17:53270,492126,703,38663,052,00037,030,0002,461,696
2Apr 9, 2025 17:53271,432136,449,04056,241,00044,189,0002,535,424
3Apr 9, 2025 17:53273,592129,243,35563,143,00038,086,0002,539,520