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 23:38Valentin KofmanValentin KofmanScore: 15,395Success
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 23:3815,069143,583,994121,574,0001,993,0002,408,448
2Jul 6, 2025 23:3815,199152,864,915122,636,0001,994,0002,404,352
3Jul 6, 2025 23:3815,246153,720,831123,017,0002,000,0002,404,352
4Jul 6, 2025 23:3815,374145,636,779124,066,0002,001,0002,506,752
5Jul 6, 2025 23:3815,395149,830,374125,237,0001,001,0002,486,272
6Jul 6, 2025 23:3815,409152,898,802125,350,0001,002,0002,486,272
7Jul 6, 2025 23:3815,662155,108,302127,424,0001,003,0002,412,544
8Jul 6, 2025 23:3815,707156,006,024127,799,000998,0002,478,080
9Jul 6, 2025 23:3815,744156,062,418127,102,0002,001,0002,412,544