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 00:07Josu San MartinJosu San MartinScore: 70,395Success
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 00:0769,87651,484,26224,860,000994,0002,363,392
2Jan 13, 2026 00:0769,90553,475,13124,871,000994,0002,363,392
3Jan 13, 2026 00:0770,15450,120,44924,959,000998,0002,363,392
4Jan 13, 2026 00:0770,34153,546,83225,025,0001,001,0002,289,664
5Jan 13, 2026 00:0770,39551,712,18424,043,0002,003,0002,367,488
6Jan 13, 2026 00:0770,39750,669,37025,046,0001,001,0002,363,392
7Jan 13, 2026 00:0770,54351,558,61424,094,0002,007,0002,465,792
8Jan 13, 2026 00:0770,63850,514,83424,126,0002,010,0002,367,488
9Jan 13, 2026 00:0770,64949,041,27624,130,0002,010,0002,359,296