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 16, 2023 16:22Paul MasurelPaul MasurelScore: 71,195Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 16, 2023 16:2270,49550,349,85825,080,0001,003,0002,363,392
2Jul 16, 2023 16:2270,53552,402,31524,091,0002,007,0002,281,472
3Jul 16, 2023 16:2270,65150,634,44124,131,0002,010,0002,355,200
4Jul 16, 2023 16:2270,84952,117,01125,206,0001,008,0002,281,472
5Jul 16, 2023 16:2271,09753,627,68324,283,0002,023,0002,355,200
6Jul 16, 2023 16:2271,15152,469,43324,301,0002,025,0002,351,104
7Jul 16, 2023 16:2271,19548,983,94824,316,0002,026,0002,281,472
8Jul 16, 2023 16:2271,23856,549,09825,345,0001,013,0002,281,472
9Jul 16, 2023 16:2271,54950,831,40125,455,0001,018,0002,363,392
10Jul 16, 2023 16:2273,643103,109,91527,247,89402,252,800
11Jul 16, 2023 16:2273,95498,346,28527,363,08302,199,552
12Jul 16, 2023 16:2274,42293,748,90327,536,23802,195,456