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 24, 2024 20:37Charlie ShepherdCharlie ShepherdScore: 718,710Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2024 20:37618,157283,633,112228,718,21502,265,088
2Aug 24, 2024 20:37718,710330,158,771265,922,85802,363,392
3Aug 24, 2024 20:37811,351366,495,206300,199,68802,232,320