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 16, 2023 15:08Paul MasurelPaul MasurelScore: 74,767Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2023 15:0873,661110,385,26627,254,64102,199,552
2Jul 16, 2023 15:0874,76797,464,15227,663,81202,187,264
3Jul 16, 2023 15:0879,136100,362,31429,280,32702,191,360