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 18, 2025 08:23Emanuele BolognesiEmanuele BolognesiScore: 812,714Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 18, 2025 08:23804,132328,467,350126,799,000170,730,0002,396,160
2Apr 18, 2025 08:23812,714327,273,092126,875,000173,829,0002,404,352
3Apr 18, 2025 08:23824,884334,579,977127,086,000178,121,0002,285,568