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 listApr 25, 2026 00:59Charles CabergsCharles CabergsScore: 70,813Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 25, 2026 01:0070,71341,445,98024,152,0002,012,0002,355,200
2Apr 25, 2026 01:0070,72145,784,26824,155,0002,012,0002,359,296
3Apr 25, 2026 01:0070,76241,904,38824,168,0002,014,0002,367,488
4Apr 25, 2026 01:0070,78345,562,78224,176,0002,014,0002,375,680
5Apr 25, 2026 01:0070,81339,918,71025,194,0001,007,0002,424,832
6Apr 25, 2026 01:0070,97543,423,50024,241,0002,020,0002,351,104
7Apr 25, 2026 01:0071,03539,594,53925,273,0001,010,0002,363,392
8Apr 25, 2026 01:0071,05140,753,77025,278,0001,011,0002,359,296
9Apr 25, 2026 01:0073,02436,883,37225,018,0002,001,0002,297,856