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 listMar 14, 2025 22:29Aniruddha DebAniruddha DebScore: 116,532Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2025 22:29115,78471,986,08641,844,000996,0002,531,328
2Mar 14, 2025 22:29115,99568,916,96141,920,000998,0002,433,024
3Mar 14, 2025 22:29116,47068,492,58841,090,0002,004,0002,531,328
4Mar 14, 2025 22:29116,47364,020,75542,093,0001,002,0002,428,928
5Mar 14, 2025 22:29116,53270,602,17642,115,0001,002,0002,437,120
6Mar 14, 2025 22:29116,72267,696,51341,179,0002,008,0002,433,024
7Mar 14, 2025 22:29117,19765,688,71843,363,00002,531,328
8Mar 14, 2025 22:29117,41473,220,24943,443,00002,531,328
9Mar 14, 2025 22:29117,54964,526,82043,493,00002,510,848