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 7, 2026 20:29Pavel SkripkinPavel SkripkinScore: 6,012Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 7, 2026 20:305,79464,301,20839,686,0007,826,0002,510,848
2May 7, 2026 20:305,88161,509,76139,556,0008,676,0002,387,968
3May 7, 2026 20:305,88963,953,18539,823,0008,469,0002,301,952
4May 7, 2026 20:305,99364,716,85940,449,0008,698,0002,424,832
5May 7, 2026 20:306,01265,257,11740,562,0008,739,0002,486,272
6May 7, 2026 20:306,07965,666,51840,893,0008,961,0002,519,040
7May 7, 2026 20:306,09865,271,18440,650,0009,355,0002,445,312
8May 7, 2026 20:306,14467,475,38541,365,0009,016,0002,301,952
9May 7, 2026 20:306,31464,671,71541,921,0009,858,0002,486,272