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 listOct 6, 2026 08:21janwwwjanwwwScore: 21,433,116Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 6, 2026 08:2321,340,7897,906,932,2387,740,124,000155,968,0002,113,536
2Oct 6, 2026 08:2321,433,1167,941,323,1647,775,127,000155,126,0002,113,536
3Oct 6, 2026 08:2321,480,8457,958,687,4307,794,505,000153,408,0002,113,536