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 listJul 2, 2026 15:12A_ShamanA_ShamanScore: 14,046Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 15:1313,905123,309,479112,018,0002,005,0002,113,536
2Jul 2, 2026 15:1313,967123,836,564112,519,0002,011,0002,113,536
3Jul 2, 2026 15:1313,988123,963,868112,623,0002,079,0002,113,536
4Jul 2, 2026 15:1314,022124,283,082112,938,0002,049,0002,113,536
5Jul 2, 2026 15:1314,046124,573,413113,166,0002,017,0002,113,536
6Jul 2, 2026 15:1314,061124,834,226113,198,0002,104,0002,113,536
7Jul 2, 2026 15:1314,083124,839,710113,459,0002,022,0002,113,536
8Jul 2, 2026 15:1314,091124,863,670113,497,0002,057,0002,113,536
9Jul 2, 2026 15:1314,108125,033,099113,525,0002,163,0002,113,536