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 21, 2026 23:45M-RochatM-RochatScore: 7,426Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2026 23:487,23068,731,40156,070,0003,222,0002,113,536
2May 21, 2026 23:487,29069,158,64456,422,0003,362,0002,113,536
3May 21, 2026 23:487,40372,169,35957,375,0003,334,0002,113,536
4May 21, 2026 23:487,41583,698,45157,543,0003,265,0002,117,632
5May 21, 2026 23:487,42670,685,00157,673,0003,224,0002,113,536
6May 21, 2026 23:4819,196168,497,186153,066,0004,348,0002,117,632
7May 21, 2026 23:4819,369168,200,549154,562,0004,269,0002,113,536
8May 21, 2026 23:4819,371169,029,385154,454,0004,391,0002,117,632
9May 21, 2026 23:4819,395178,448,631154,705,0004,336,0002,113,536