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: 274,108Success
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,935129,882,42457,992,00042,994,0002,293,760
2Apr 9, 2025 16:32274,108128,752,41357,237,00044,183,0002,535,424
3Apr 9, 2025 16:32276,597132,865,79750,167,00052,174,0002,535,424