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 29, 2024 16:01AnSaAnSaScore: 71,895Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2024 16:0171,23251,300,79324,329,0002,027,0002,281,472
2Jan 29, 2024 16:0171,61649,238,64325,479,0001,019,0002,289,664
3Jan 29, 2024 16:0171,65451,249,25124,473,0002,039,0002,281,472
4Jan 29, 2024 16:0171,68954,114,81924,485,0002,040,0002,281,472
5Jan 29, 2024 16:0171,75448,496,26125,528,0001,021,0002,527,232
6Jan 29, 2024 16:0171,77051,386,98125,534,0001,021,0002,269,184
7Jan 29, 2024 16:0171,89554,810,43324,555,0002,046,0002,269,184
8Jan 29, 2024 16:0172,00049,135,64325,616,0001,024,0002,281,472
9Jan 29, 2024 16:0172,06850,289,17724,614,0002,051,0002,289,664
10Jan 29, 2024 16:0176,36397,621,64128,254,33202,269,184
11Jan 29, 2024 16:0176,52497,727,52228,313,83202,269,184
12Jan 29, 2024 16:0176,71888,940,13928,385,48702,297,856