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:59Joad NacerJoad NacerScore: 75,189Success
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:5975,041101,584,45527,765,15802,293,760
2Jul 27, 2024 14:5975,18996,282,54727,820,02202,289,664
3Jul 27, 2024 14:5975,32884,651,35127,871,35502,297,856