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 listOct 14, 2024 18:14Joad NacerJoad NacerScore: 72,105Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2024 18:1472,04349,658,59725,631,0001,025,0002,535,424
2Oct 14, 2024 18:1472,10556,153,62625,653,0001,026,0002,424,832
3Oct 14, 2024 18:1472,61453,519,97124,877,0001,990,0002,535,424