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 listMar 10, 2026 20:30olliecrowolliecrowScore: 10,951Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 10, 2026 20:3010,640108,681,08585,241,0002,005,0002,453,504
2Mar 10, 2026 20:3010,790113,017,21588,476,00002,449,408
3Mar 10, 2026 20:3010,895113,189,52685,323,0004,015,0002,273,280
4Mar 10, 2026 20:3010,930116,220,94687,615,0002,014,0002,457,600
5Mar 10, 2026 20:3010,951116,101,16488,804,000997,0002,506,752
6Mar 10, 2026 20:3010,952118,758,26387,809,0001,995,0002,383,872
7Mar 10, 2026 20:3011,047119,612,87186,603,0003,981,0002,330,624
8Mar 10, 2026 20:3011,088114,717,70186,928,0003,996,0002,359,296
9Mar 10, 2026 20:3015,384154,601,566123,148,0003,003,0002,498,560