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, 2026 06:30Elijah KinElijah KinScore: 66,978Success
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, 2026 06:3166,73533,729,13323,595,0001,097,0002,113,536
2Jun 21, 2026 06:3166,85433,819,25723,613,0001,123,0002,113,536
3Jun 21, 2026 06:3166,85633,762,72023,612,0001,125,0002,113,536
4Jun 21, 2026 06:3166,96733,806,73023,664,0001,114,0002,113,536
5Jun 21, 2026 06:3166,97833,841,22123,662,0001,120,0002,113,536
6Jun 21, 2026 06:3167,23733,955,59723,840,0001,038,0002,113,536
7Jun 21, 2026 06:3167,32933,952,59523,814,0001,098,0002,113,536
8Jun 21, 2026 06:3167,38933,920,23223,807,0001,127,0002,113,536
9Jun 21, 2026 06:3167,61034,080,81723,969,0001,047,0002,113,536