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 listSep 12, 2026 07:43Haha ExpertHaha ExpertScore: 32,124Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 07:4431,819269,414,591124,532,000136,385,0002,117,632
2Sep 12, 2026 07:4431,942270,586,595125,297,000136,633,0002,117,632
3Sep 12, 2026 07:4431,982275,814,464124,846,000137,410,0002,117,632
4Sep 12, 2026 07:4432,075271,691,966124,931,000138,091,0002,117,632
5Sep 12, 2026 07:4432,124272,817,222124,851,000138,568,0002,117,632
6Sep 12, 2026 07:4432,130272,052,026124,707,000138,761,0002,117,632
7Sep 12, 2026 07:4432,146272,404,794125,473,000138,130,0002,117,632
8Sep 12, 2026 07:4432,253273,138,548125,102,000139,374,0002,117,632
9Sep 12, 2026 07:4432,563275,728,759130,516,000136,505,0002,117,632