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 listMay 16, 2026 20:00M-RochatM-RochatScore: 23,441Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 16, 2026 20:2522,756195,374,400185,597,0001,004,0002,113,536
2May 16, 2026 20:2523,095198,907,636188,119,0001,261,0002,113,536
3May 16, 2026 20:2523,152200,242,342188,845,0001,005,0002,113,536
4May 16, 2026 20:2523,177198,856,652189,050,0001,003,0002,113,536
5May 16, 2026 20:2523,441202,884,643191,221,0001,003,0002,113,536
6May 16, 2026 20:2523,557202,036,857192,155,0001,017,0002,113,536
7May 16, 2026 20:2523,613203,208,303192,624,0001,004,0002,113,536
8May 16, 2026 20:2523,732205,102,750193,605,0001,002,0002,113,536
9May 16, 2026 20:2523,888204,681,198194,882,0001,003,0002,113,536