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 15, 2025 18:23Valentin KofmanValentin KofmanScore: 63,541Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2025 18:2363,39549,909,22822,437,0001,019,0002,404,352
2Jul 15, 2025 18:2363,47048,775,02923,484,00002,387,968
3Jul 15, 2025 18:2363,47358,057,19322,464,0001,021,0002,400,256
4Jul 15, 2025 18:2363,50344,417,81122,475,0001,021,0002,269,184
5Jul 15, 2025 18:2363,54147,257,26823,510,00002,392,064
6Jul 15, 2025 18:2363,70348,012,90722,546,0001,024,0002,269,184
7Jul 15, 2025 18:2363,75449,390,03923,589,00002,269,184
8Jul 15, 2025 18:2363,86557,422,97223,630,00002,269,184
9Jul 15, 2025 18:2364,01150,577,95822,655,0001,029,0002,269,184