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 listNov 4, 2026 04:42e1011e1011Score: 161,629Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 4, 2026 04:43123,2301,021,372,292853,117,000157,370,0002,113,536
2Nov 4, 2026 04:43141,8201,175,351,3401,003,105,000159,825,0002,113,536
3Nov 4, 2026 04:43144,6701,197,197,5541,026,627,000159,668,0002,113,536
4Nov 4, 2026 04:43155,3231,285,009,4531,115,820,000157,829,0002,113,536
5Nov 4, 2026 04:43161,6291,336,817,7371,165,893,000159,466,0002,113,536
6Nov 4, 2026 04:43163,4911,351,607,7651,180,622,000160,006,0002,113,536
7Nov 4, 2026 04:43167,1671,381,846,4451,210,041,000160,736,0002,113,536
8Nov 4, 2026 04:43170,9231,413,039,2881,242,368,000159,204,0002,113,536
9Nov 4, 2026 04:43175,6921,452,134,9961,284,506,000156,170,0002,113,536