Median Sergey Svistunov

Find the median of 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 median value, printed as a decimal string. The median is defined as the element at index N/2 (i.e., a[50000000]) in the sorted array.

Back to listApr 15, 2026 02:30zielajzielajScore: 2,877Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 15, 2026 02:232,80152,359,99421,968,000998,0002,334,720
2Apr 15, 2026 02:302,80355,644,27321,985,000999,0002,465,792
3Apr 15, 2026 02:302,80744,939,59521,019,0002,001,0002,457,600
4Apr 15, 2026 02:232,82645,592,50922,166,0001,007,0002,441,216
5Apr 15, 2026 02:302,83646,425,44421,236,0002,022,0002,363,392
6Apr 15, 2026 02:302,83849,822,11921,245,0002,023,0002,285,568
7Apr 15, 2026 02:302,87746,215,04922,612,000983,0002,326,528
8Apr 15, 2026 02:305,31267,147,32742,547,0001,013,0002,412,544
9Apr 15, 2026 02:235,32369,013,63543,651,00002,269,184
10Apr 15, 2026 02:305,34171,066,24741,808,0001,990,0002,514,944
11Apr 15, 2026 02:305,35268,122,83641,893,0001,994,0002,486,272
12Apr 15, 2026 02:305,38667,001,07141,151,0003,011,0002,441,216