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:07Paul MasurelPaul MasurelScore: 74,319Success
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:0774,01594,306,64127,385,73202,187,264
2Jul 16, 2023 15:0774,319100,790,31527,498,07902,199,552
3Jul 16, 2023 15:0774,44984,050,26827,546,08702,195,456