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 12:00NoSIMD_C#NoSIMD_C#Score: 586,505Success
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 12:00579,322242,379,320168,274,00046,075,0002,322,432
2Apr 9, 2025 12:00586,505242,769,765171,006,00046,001,0002,539,520
3Apr 9, 2025 12:00587,462245,563,318172,286,00045,075,0002,416,640