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 17:57Dominique GarmierDominique GarmierScore: 98,505Success
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 17:5794,60355,710,27633,003,0002,000,0002,277,376
2Mar 25, 2026 20:5494,69760,490,63433,036,0002,002,0002,478,080
3Mar 25, 2026 20:5494,81661,597,31633,078,0002,004,0002,478,080
4Mar 25, 2026 17:5798,50559,443,00335,435,0001,012,0002,277,376
5Mar 25, 2026 17:5798,79563,599,58335,539,0001,015,0002,465,792
6Mar 25, 2026 20:5498,99557,576,37435,611,0001,017,0002,277,376