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 listApr 21, 2025 04:36Steve BronderSteve BronderScore: 73,808Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2025 04:3673,61147,622,64825,219,0002,017,0002,510,848
2Apr 21, 2025 04:3673,80850,121,46126,298,0001,011,0002,424,832
3Apr 21, 2025 04:3673,92448,962,50625,326,0002,026,0002,531,328