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 listFeb 7, 2026 02:43Josu San MartinJosu San MartinScore: 15,923Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 02:4315,593159,723,177124,863,0002,996,0002,453,504
2Feb 7, 2026 02:4315,923156,795,184129,562,0001,004,0002,506,752
3Feb 7, 2026 02:4316,308162,947,809131,731,0001,995,0002,465,792