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 5, 2026 04:16e1011e1011Score: 23,191Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2026 04:1623,130200,670,143187,657,0002,009,0002,113,536
2Nov 5, 2026 04:1623,157200,903,898187,872,0002,018,0002,113,536
3Nov 5, 2026 04:1623,184201,585,894188,105,0002,011,0002,113,536
4Nov 5, 2026 04:1623,187201,552,838188,118,0002,022,0002,113,536
5Nov 5, 2026 04:1623,191201,087,513188,163,0002,009,0002,113,536
6Nov 5, 2026 04:1623,219201,232,758188,377,0002,019,0002,113,536
7Nov 5, 2026 04:1623,274202,334,506188,826,0002,023,0002,113,536
8Nov 5, 2026 04:1623,311202,020,605189,144,0002,012,0002,113,536
9Nov 5, 2026 04:1623,324202,628,696189,250,0002,012,0002,113,536