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:10Paul MasurelPaul MasurelScore: 73,993Success
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:1073,63488,443,51227,244,46702,207,744
2Jul 16, 2023 15:1073,99376,904,26727,377,47902,199,552
3Jul 16, 2023 15:1074,312100,631,29927,495,29602,203,648