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:37NoSIMD_C#NoSIMD_C#Score: 596,622Success
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:37593,584243,233,193174,498,00045,128,0002,527,232
2Apr 9, 2025 16:37596,622249,832,411176,800,00043,950,0002,490,368
3Apr 9, 2025 16:37597,414254,682,029177,035,00044,008,0002,482,176