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 16:58Abhigyan NiranjanAbhigyan NiranjanScore: 5,609,200Success
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 16:585,596,0782,096,858,9862,068,551,0001,998,0002,322,432
2Jun 19, 2025 16:585,602,1842,106,182,7512,071,809,000999,0002,326,528
3Jun 19, 2025 16:585,604,8812,108,086,2712,072,807,000999,0002,322,432
4Jun 19, 2025 16:585,608,9382,098,201,9502,075,307,00002,326,528
5Jun 19, 2025 16:585,609,2002,101,207,1892,074,405,000999,0002,478,080
6Jun 19, 2025 16:585,611,4682,095,561,7412,074,244,0001,999,0002,322,432
7Jun 19, 2025 16:585,611,6972,103,291,8092,075,329,000999,0002,322,432
8Jun 19, 2025 16:585,612,1222,102,912,8442,076,485,00002,469,888
9Jun 19, 2025 16:585,623,4492,104,877,3422,077,678,0002,998,0002,469,888