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 listApr 14, 2026 03:30Yuriy LyfenkoYuriy LyfenkoScore: 3,978Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 14, 2026 03:303,67556,676,69325,115,0005,023,0002,510,848
2Apr 14, 2026 03:303,97860,986,15432,620,00002,289,664
3Apr 14, 2026 03:304,02759,295,95228,020,0005,003,0002,449,408