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 listJan 18, 2026 06:40Josu San MartinJosu San MartinScore: 20,080Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 18, 2026 06:4020,060194,714,495136,410,00028,084,0002,371,584
2Jan 18, 2026 06:4020,080190,368,536131,725,00032,931,0002,359,296
3Jan 18, 2026 06:4020,170191,623,439139,333,00026,062,0002,363,392