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 15:15TudyMTudyMScore: 20,867Success
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 15:2320,529184,854,092166,320,0002,020,0002,457,600
2May 3, 2026 15:2320,630188,953,947167,147,0002,023,0002,539,520
3May 3, 2026 15:2320,751186,273,069167,132,0003,028,0002,318,336
4May 3, 2026 15:2320,807188,006,073167,505,0003,113,0002,478,080
5May 3, 2026 15:2320,867187,784,944168,014,0003,100,0002,404,352
6May 3, 2026 15:2320,925187,509,361168,339,0003,251,0002,531,328
7May 3, 2026 15:2320,963188,736,008168,751,0003,146,0002,400,256
8May 3, 2026 15:2320,994185,874,067170,136,0002,021,0002,342,912
9May 3, 2026 15:2321,082192,084,439169,597,0003,279,0002,539,520