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 listJul 6, 2025 10:15Aniruddha DebAniruddha DebScore: 5,741Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 6, 2025 10:155,64871,439,67846,313,00002,351,104
2Jul 6, 2025 10:155,71775,007,51244,885,0001,994,0002,330,624
3Jul 6, 2025 10:155,73076,562,45244,988,0001,999,0002,412,544
4Jul 6, 2025 10:155,73969,778,05346,059,0001,001,0002,400,256
5Jul 6, 2025 10:155,74166,413,88845,070,0002,003,0002,473,984
6Jul 6, 2025 10:155,84177,073,79645,898,0001,995,0002,392,064
7Jul 6, 2025 10:155,84675,809,97545,937,0001,997,0002,482,176
8Jul 6, 2025 10:155,88074,406,06745,205,0003,013,0002,490,368
9Jul 6, 2025 10:156,12271,600,39847,188,0003,012,0002,400,256