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 20, 2026 16:35BenBenScore: 154,537Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2026 16:36151,40278,398,0599,003,00047,016,0002,453,504
2Apr 20, 2026 16:36154,53780,494,19210,031,00047,148,0002,445,312
3Apr 20, 2026 16:36157,15483,504,6426,015,00052,132,0002,457,600