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 listJan 2, 2026 04:41Rajarshi BasuRajarshi BasuScore: 9,826Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 04:418,757103,173,63463,826,0007,978,0002,285,568
2Jan 2, 2026 04:418,82098,367,54468,306,0004,018,0002,392,064
3Jan 2, 2026 04:418,998101,779,33969,798,0003,988,0002,433,024
4Jan 2, 2026 04:419,340111,535,50270,539,0006,046,0002,334,720
5Jan 2, 2026 04:419,366110,007,93074,808,0001,994,0002,523,136
6Jan 2, 2026 04:419,613109,376,00672,837,0005,986,0002,506,752
7Jan 2, 2026 04:419,826108,625,14075,536,0005,035,0002,506,752
8Jan 2, 2026 04:4192,916790,512,947640,924,000120,985,0002,318,336
9Jan 2, 2026 04:41101,251859,128,276694,379,000135,878,0002,306,048
10Jan 2, 2026 04:41101,318860,885,251716,837,000113,974,0002,469,888
11Jan 2, 2026 04:41105,563891,807,357741,675,000123,945,0002,281,472
12Jan 2, 2026 04:41109,162922,305,729779,239,000115,886,0002,453,504