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 listJan 13, 2026 01:31Josu San MartinJosu San MartinScore: 72,546Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 13, 2026 01:3172,23050,382,08325,736,000989,0002,363,392
2Jan 13, 2026 01:3172,54656,416,75726,842,00002,367,488
3Jan 13, 2026 01:3172,57658,717,28025,859,000994,0002,355,200