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 15:26Abhigyan NiranjanAbhigyan NiranjanScore: 5,718,824Success
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 15:265,711,8142,144,075,1612,062,411,00050,960,0002,322,432
2Jun 19, 2025 15:265,715,6002,143,495,0802,068,799,00045,973,0002,326,528
3Jun 19, 2025 15:265,715,6142,141,769,8002,065,806,00048,971,0002,322,432
4Jun 19, 2025 15:265,718,3412,146,377,9322,070,812,00044,974,0002,322,432
5Jun 19, 2025 15:265,718,8242,141,682,1812,064,990,00050,975,0002,326,528
6Jun 19, 2025 15:265,719,5462,142,750,5772,070,249,00045,983,0002,322,432
7Jun 19, 2025 15:265,723,5862,147,940,5002,078,751,00038,976,0002,437,120
8Jun 19, 2025 15:265,728,1782,143,146,2052,077,438,00041,988,0002,322,432
9Jun 19, 2025 15:265,729,1272,149,110,4932,070,806,00048,971,0002,437,120