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 11, 2025 17:06Dan StolyarovDan StolyarovScore: 282,824Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 11, 2025 17:06281,059127,571,53564,995,00038,997,0002,457,600
2Mar 11, 2025 17:06281,600126,533,89653,098,00051,094,0002,449,408
3Mar 11, 2025 17:06281,973130,932,43527,085,00077,245,0002,449,408
4Mar 11, 2025 17:06282,603130,492,33653,287,00051,276,0002,461,696
5Mar 11, 2025 17:06282,824132,433,75456,807,00047,838,0002,461,696
6Mar 11, 2025 17:06282,962130,936,61957,832,00046,864,0002,461,696
7Mar 11, 2025 17:06283,778128,959,76859,999,00044,999,0002,465,792
8Mar 11, 2025 17:06284,330128,286,85353,102,00052,100,0002,461,696
9Mar 11, 2025 17:06285,157137,256,75850,242,00055,266,0002,289,664