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 listFeb 3, 2025 05:30NoSIMD_C#NoSIMD_C#Score: 21,500,327Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2025 05:3021,489,3737,986,196,7127,755,239,000195,829,0002,506,752
2Feb 3, 2025 05:3021,500,3277,982,925,4317,768,260,000186,861,0002,269,184
3Feb 3, 2025 05:3021,550,7228,006,417,4477,773,924,000199,843,0002,269,184