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 listMar 12, 2026 21:36Josu San MartinJosu San MartinScore: 3,405Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 12, 2026 21:363,40253,601,89824,907,0002,988,0002,338,816
2Mar 12, 2026 21:363,40559,064,34225,928,0001,994,0002,392,064
3Mar 12, 2026 21:3611,795123,298,29994,725,0001,994,0002,473,984