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 listDec 4, 2024 03:56Hayden DonnellyHayden DonnellyScore: 115,003Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 4, 2024 03:56114,87665,533,09442,504,00002,527,232
2Dec 4, 2024 03:56115,00364,688,63341,538,0001,013,0002,371,584
3Dec 4, 2024 03:56115,77667,280,91741,841,000996,0002,265,088