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 8, 2025 07:20NoSIMD_C#NoSIMD_C#Score: 21,444,786Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 8, 2025 07:2021,366,4737,935,664,4487,701,761,000203,834,0002,281,472
2Apr 8, 2025 07:2021,444,7867,969,670,8547,729,737,000204,834,0002,310,144
3Apr 8, 2025 07:2021,569,4898,012,303,4027,767,879,000212,832,0002,281,472