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 04:14Chandrasekaran AkashChandrasekaran AkashScore: 67,668Success
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 04:1467,51449,887,57922,982,0001,998,0002,269,184
2Apr 14, 2025 04:1467,66850,414,92623,034,0002,003,0002,265,088
3Apr 14, 2025 04:1468,02747,340,82323,157,0002,013,0002,531,328