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 listSep 3, 2026 04:25Josu San MartinJosu San MartinScore: 4,068Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 04:264,04243,956,48630,837,0002,309,0002,113,536
2Sep 3, 2026 04:264,04243,989,63430,838,0002,311,0002,113,536
3Sep 3, 2026 04:264,05143,258,59430,999,0002,225,0002,113,536
4Sep 3, 2026 04:264,05743,960,53230,958,0002,316,0002,113,536
5Sep 3, 2026 04:264,06844,248,16631,299,0002,063,0002,113,536
6Sep 3, 2026 04:264,07544,225,48231,149,0002,267,0002,113,536
7Sep 3, 2026 04:264,08844,341,28931,445,0002,078,0002,113,536
8Sep 3, 2026 04:264,09643,968,60831,216,0002,376,0002,113,536
9Sep 3, 2026 04:2612,298111,043,36994,348,0006,499,0002,113,536