TopK Sergey Svistunov

Find the sum of the 100 largest values in 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 uint64 sum of the top 100 greatest values, printed as a decimal string.

Back to listNov 10, 2025 16:19izotoffizotoffScore: 120,827Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 10, 2025 16:19119,95766,274,26143,376,0001,008,0002,322,432
2Nov 10, 2025 16:19120,03572,436,82242,395,0002,018,0002,326,528
3Nov 10, 2025 16:19120,30066,594,08743,500,0001,011,0002,322,432
4Nov 10, 2025 16:19120,66569,152,12343,632,0001,014,0002,322,432
5Nov 10, 2025 16:19120,82775,560,97544,706,00002,420,736
6Nov 10, 2025 16:19121,16569,569,17741,843,0002,988,0002,428,928
7Nov 10, 2025 16:19121,65773,580,53044,013,0001,000,0002,433,024
8Nov 10, 2025 16:19121,93068,635,01043,109,0002,005,0002,322,432
9Nov 10, 2025 16:19122,77872,622,23843,409,0002,019,0002,322,432