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:14NoSIMD_C#NoSIMD_C#Score: 274,092Success
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:14273,135131,779,53662,037,00039,023,0002,297,856
2Apr 9, 2025 16:14274,092132,196,28456,230,00045,184,0002,543,616
3Apr 9, 2025 16:14278,581128,042,24959,043,00044,032,0002,543,616