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 27, 2026 22:07TudyMTudyMScore: 17,475Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 22:1117,433158,359,856138,958,0003,998,0002,363,392
2Apr 27, 2026 22:1117,445158,797,334140,049,0003,001,0002,367,488
3Apr 27, 2026 22:1117,468162,655,207141,240,0002,003,0002,371,584
4Apr 27, 2026 22:1117,473165,469,019137,271,0006,011,0002,367,488
5Apr 27, 2026 22:1117,475162,857,529142,298,0001,002,0002,297,856
6Apr 27, 2026 22:1117,500161,081,416142,502,0001,003,0002,367,488
7Apr 27, 2026 22:1117,529158,305,115141,742,0001,996,0002,367,488
8Apr 27, 2026 22:1117,535159,495,337141,795,0001,997,0002,281,472
9Apr 27, 2026 22:1117,746159,788,421141,507,0004,014,0002,367,488