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:17NoSIMD_C#NoSIMD_C#Score: 275,203Success
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:17273,778133,779,04064,189,00037,109,0002,457,600
2Apr 9, 2025 16:17275,203126,406,01355,904,00045,921,0002,539,520
3Apr 9, 2025 16:17277,862131,024,39258,891,00043,918,0002,293,760