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:39Paul MasurelPaul MasurelScore: 74,667Success
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:3974,52389,524,21927,573,60402,191,360
2Jul 16, 2023 15:3974,667133,931,89327,626,71202,199,552
3Jul 16, 2023 15:3974,85485,744,54627,696,03102,199,552