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 listJan 28, 2025 08:41mebowlermebowlerScore: 292,616Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 28, 2025 08:41290,373129,605,95165,266,00042,172,0002,330,624
2Jan 28, 2025 08:41291,589132,595,82758,939,00048,949,0002,330,624
3Jan 28, 2025 08:41292,132131,832,84056,046,00052,043,0002,531,328
4Jan 28, 2025 08:41292,259134,020,00662,078,00046,058,0002,330,624
5Jan 28, 2025 08:41292,616128,637,28964,159,00044,109,0002,330,624
6Jan 28, 2025 08:41292,808134,347,67264,201,00044,138,0002,330,624
7Jan 28, 2025 08:41292,827131,235,04559,189,00049,157,0002,527,232
8Jan 28, 2025 08:41294,043137,431,49360,886,00047,910,0002,330,624
9Jan 28, 2025 08:41294,681139,672,29960,018,00049,014,0002,527,232