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 listApr 26, 2026 20:05TudyMTudyMScore: 17,553Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2026 20:0517,482160,363,978142,357,0001,002,0002,510,848
2Apr 26, 2026 20:0517,512159,974,549141,610,0001,994,0002,519,040
3Apr 26, 2026 20:0517,538160,808,563141,820,0001,997,0002,523,136
4Apr 26, 2026 20:0517,545163,953,471140,876,0002,997,0002,519,040
5Apr 26, 2026 20:0517,553167,872,964141,938,0001,999,0002,519,040
6Apr 26, 2026 20:0517,555161,681,669141,956,0001,999,0002,523,136
7Apr 26, 2026 20:0517,560162,090,461140,977,0003,020,0002,514,944
8Apr 26, 2026 20:0517,584158,554,813143,190,0001,001,0002,330,624
9Apr 26, 2026 20:0517,727163,941,461142,360,0003,007,0002,519,040