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 listJun 29, 2026 01:57Victor MerckléVictor MerckléScore: 3,166Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 29, 2026 01:573,11433,378,04624,450,0001,092,0002,113,536
2Jun 29, 2026 01:573,13233,638,62524,588,0001,099,0002,113,536
3Jun 29, 2026 01:573,13433,502,36724,590,0001,109,0002,113,536
4Jun 29, 2026 01:573,13533,433,78224,552,0001,163,0002,113,536
5Jun 29, 2026 01:573,16633,745,48024,865,0001,102,0002,113,536
6Jun 29, 2026 01:573,19334,128,90225,005,0001,182,0002,113,536
7Jun 29, 2026 01:5712,104106,988,69498,245,0001,008,0002,113,536
8Jun 29, 2026 01:5712,137107,275,72898,523,0001,007,0002,113,536
9Jun 29, 2026 01:5712,765112,680,970103,668,0001,010,0002,113,536