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 14, 2025 06:09Chandrasekaran AkashChandrasekaran AkashScore: 67,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 14, 2025 06:0864,04154,630,49022,665,0001,030,0002,269,184
2Apr 14, 2025 06:0864,45751,039,35421,862,0001,987,0002,441,216
3Apr 14, 2025 06:0865,52242,645,85823,233,0001,010,0002,531,328
4Apr 14, 2025 06:0967,44952,490,65223,958,000998,0002,445,312
5Apr 14, 2025 06:0967,71449,039,56724,052,0001,002,0002,531,328
6Apr 14, 2025 06:0967,73245,428,97324,059,0001,002,0002,531,328
7Apr 14, 2025 06:0967,75449,440,98825,069,00002,445,312
8Apr 14, 2025 06:0967,88946,312,10824,115,0001,004,0002,531,328
9Apr 14, 2025 06:0967,90047,772,14923,114,0002,009,0002,531,328