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 listJun 19, 2025 14:26Abhigyan NiranjanAbhigyan NiranjanScore: 31,278,292Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2025 14:2631,247,54611,592,471,53711,484,635,00076,957,0002,519,040
2Jun 19, 2025 14:2631,259,10811,605,609,62311,493,921,00071,949,0002,310,144
3Jun 19, 2025 14:2631,274,70311,606,780,95211,496,695,00074,945,0002,465,792
4Jun 19, 2025 14:2631,276,56511,605,171,97411,490,391,00081,938,0002,490,368
5Jun 19, 2025 14:2631,278,29211,613,805,17711,492,018,00080,950,0002,449,408
6Jun 19, 2025 14:2631,279,61611,606,553,23711,476,522,00096,936,0002,289,664
7Jun 19, 2025 14:2631,293,08611,609,343,22811,506,496,00071,946,0002,338,816
8Jun 19, 2025 14:2631,305,61111,621,121,68311,514,124,00068,952,0002,498,560
9Jun 19, 2025 14:2631,367,93211,641,563,46811,516,189,00089,946,0002,490,368