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 2, 2026 05:01Rajarshi BasuRajarshi BasuScore: 97,489Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 04:586,49482,572,97248,225,0005,023,0002,297,856
2Jan 2, 2026 04:586,51379,210,42548,368,0005,038,0002,473,984
3Jan 2, 2026 04:586,76280,602,32653,434,0002,016,0002,469,888
4Jan 2, 2026 04:586,89180,549,57951,460,0005,045,0002,514,944
5Jan 2, 2026 04:587,13084,188,01054,437,0004,032,0002,527,232
6Jan 2, 2026 04:5891,650779,133,592628,611,000122,923,0002,281,472
7Jan 2, 2026 04:5897,489824,656,963667,507,000131,902,0002,310,144
8Jan 2, 2026 05:01101,055854,208,264712,701,000115,951,0002,351,104
9Jan 2, 2026 04:58107,923910,862,592773,097,000111,869,0002,318,336
10Jan 2, 2026 05:01108,707918,044,687779,474,000111,924,0002,281,472
11Jan 2, 2026 04:58120,2521,013,594,291854,189,000131,874,0002,502,656
12Jan 2, 2026 05:01124,8781,052,180,079907,111,000116,885,0002,301,952