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 21, 2025 12:46thatmagicalcatthatmagicalcatScore: 972,327Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2025 12:46946,719375,607,953245,500,000104,786,0002,478,080
2Jun 21, 2025 12:46955,292376,350,303242,628,000110,830,0002,400,256
3Jun 21, 2025 12:46961,092384,923,136239,733,000115,871,0002,469,888
4Jun 21, 2025 12:46961,203378,912,469243,757,000111,888,0002,392,064
5Jun 21, 2025 12:46972,327384,670,455249,834,000109,927,0002,396,160
6Jun 21, 2025 12:46974,476386,007,761238,706,000121,850,0002,392,064
7Jun 21, 2025 12:46976,914388,043,934247,629,000113,829,0002,396,160
8Jun 21, 2025 12:46977,884383,061,489258,869,000102,948,0002,289,664
9Jun 21, 2025 12:46989,695390,162,153251,442,000114,745,0002,498,560