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 3, 2026 14:04TudyMTudyMScore: 17,515Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 14:0517,349156,980,495140,998,0001,264,0002,359,296
2May 3, 2026 14:0517,385155,930,971141,316,0001,243,0002,359,296
3May 3, 2026 14:0517,401160,615,531141,416,0001,279,0002,375,680
4May 3, 2026 14:0517,468159,363,377142,233,0001,006,0002,363,392
5May 3, 2026 14:0517,515159,349,610142,352,0001,272,0002,334,720
6May 3, 2026 14:0517,575157,767,838142,841,0001,277,0002,347,008
7May 3, 2026 14:0517,682160,688,308143,982,0001,012,0002,351,104
8May 3, 2026 14:0517,685161,165,455144,010,0001,013,0002,371,584
9May 3, 2026 14:0517,736164,490,532144,171,0001,268,0002,383,872