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:41Josu San MartinJosu San MartinScore: 69,005Success
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:3768,48948,237,87224,328,0001,013,0002,351,104
2Jan 13, 2026 00:3768,56250,105,10324,354,0001,014,0002,347,008
3Jan 13, 2026 00:3768,62455,675,29925,391,00002,351,104
4Jan 13, 2026 00:3768,74149,220,44624,417,0001,017,0002,355,200
5Jan 13, 2026 00:4168,77344,241,54824,429,0001,017,0002,347,008
6Jan 13, 2026 00:3768,84347,460,14125,472,00002,281,472
7Jan 13, 2026 00:3769,00548,980,16125,532,00002,281,472
8Jan 13, 2026 00:4169,01949,094,51525,537,00002,351,104
9Jan 13, 2026 00:3769,07046,493,22325,556,00002,281,472
10Jan 13, 2026 00:4169,08650,439,87425,562,00002,355,200
11Jan 13, 2026 00:3769,14152,544,80325,582,00002,351,104
12Jan 13, 2026 00:3769,17047,410,23524,570,0001,023,0002,347,008