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 listJul 8, 2021 22:24Yurkov AlekseyYurkov AlekseyScore: 183,981Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 8, 2021 22:24181,947146,823,54467,320,25002,269,184
2Jul 8, 2021 22:24183,981132,284,09668,072,92102,277,376
3Jul 8, 2021 22:24184,112135,933,90168,121,50102,269,184