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:37Chandrasekaran AkashChandrasekaran AkashScore: 62,273Success
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:3762,15745,587,76221,999,000999,0002,449,408
2Apr 14, 2025 04:3762,27345,872,07722,040,0001,001,0002,531,328
3Apr 14, 2025 04:3762,58149,244,15222,149,0001,006,0002,531,328