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 14, 2025 12:52Yuriy LyfenkoYuriy LyfenkoScore: 59,362Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2025 12:5258,938543,300,52619,825,0001,982,0002,527,232
2Apr 14, 2025 12:5259,008544,159,83319,849,0001,984,0002,445,312
3Apr 14, 2025 12:5259,089545,310,72119,876,0001,987,0002,527,232
4Apr 14, 2025 12:5259,176539,495,20619,905,0001,990,0002,531,328
5Apr 14, 2025 12:5259,200543,759,85619,913,0001,991,0002,531,328
6Apr 14, 2025 12:5259,292544,030,19419,944,0001,994,0002,527,232
7Apr 14, 2025 12:5259,362546,599,16119,968,0001,996,0002,527,232
8Apr 14, 2025 12:5259,370541,494,99119,970,0001,997,0002,437,120
9Apr 14, 2025 12:5259,386544,636,05319,976,0001,997,0002,265,088
10Apr 14, 2025 12:5259,400549,443,18019,980,0001,998,0002,527,232
11Apr 14, 2025 12:5259,411545,394,81819,984,0001,998,0002,527,232
12Apr 14, 2025 12:5259,416546,482,80020,985,000999,0002,527,232