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 listApr 29, 2026 14:32olliecrowolliecrowScore: 3,339Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 14:333,31344,880,14924,151,0003,018,0002,355,200
2Apr 29, 2026 14:333,31741,204,56624,178,0003,022,0002,363,392
3Apr 29, 2026 14:333,33047,604,84326,302,0001,011,0002,514,944
4Apr 29, 2026 14:333,33744,515,39126,357,0001,013,0002,502,656
5Apr 29, 2026 14:333,33946,578,50026,370,0001,014,0002,551,808
6Apr 29, 2026 14:3323,769215,504,737190,910,0003,998,0002,310,144
7Apr 29, 2026 14:3323,780211,736,078193,004,0002,000,0002,527,232
8Apr 29, 2026 14:3323,820213,949,753194,323,0001,001,0002,527,232
9Apr 29, 2026 14:3323,974217,056,671192,603,0003,991,0002,392,064