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 listJul 27, 2024 14:58Joad NacerJoad NacerScore: 70,724Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2024 14:5869,91193,239,72825,867,16602,281,472
2Jul 27, 2024 14:5870,72480,029,58126,167,72502,289,664
3Jul 27, 2024 14:5871,04888,461,48726,287,90202,285,568