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 03:00Chandrasekaran AkashChandrasekaran AkashScore: 61,795Success
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 03:0061,74648,325,92221,853,000993,0002,527,232
2Apr 18, 2025 03:0061,79550,935,91520,876,0001,988,0002,531,328
3Apr 18, 2025 03:0061,92749,585,12420,921,0001,992,0002,269,184