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 listAug 17, 2024 14:41IhebIhebScore: 8,139,525Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2024 14:418,137,8573,069,196,9563,011,007,07802,265,088
2Aug 17, 2024 14:418,139,5253,076,089,4163,011,624,16102,404,352
3Aug 17, 2024 14:418,186,3913,085,143,7923,028,964,72002,265,088