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 7, 2025 10:08Valentin KofmanValentin KofmanScore: 10,140Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 7, 2025 10:0810,107109,335,71581,879,000998,0002,347,008
2Jul 7, 2025 10:0810,110105,649,50880,902,0001,997,0002,322,432
3Jul 7, 2025 10:0810,135108,898,70682,107,0001,001,0002,514,944
4Jul 7, 2025 10:0810,137106,003,76581,123,0002,003,0002,441,216
5Jul 7, 2025 10:0810,140107,767,15581,141,0002,003,0002,338,816
6Jul 7, 2025 10:0810,155103,291,92282,267,0001,003,0002,514,944
7Jul 7, 2025 10:0810,156108,096,28982,277,0001,003,0002,510,848
8Jul 7, 2025 10:0810,158107,549,31383,298,00002,457,600
9Jul 7, 2025 10:0810,161105,857,16783,323,00002,510,848