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 listMar 25, 2026 10:05Dominique GarmierDominique GarmierScore: 102,659Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 25, 2026 10:05102,41460,723,63835,899,0001,994,0002,277,376
2Mar 25, 2026 10:05102,65960,094,33435,985,0001,999,0002,478,080
3Mar 25, 2026 10:05106,22261,451,74838,295,0001,007,0002,469,888