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 listOct 20, 2026 00:41e1011e1011Score: 158,556Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 20, 2026 00:42156,50269,272,60056,696,0001,210,0002,113,536
2Oct 20, 2026 00:42156,98669,497,20457,070,0001,015,0002,113,536
3Oct 20, 2026 00:42157,25669,069,30957,076,0001,109,0002,113,536
4Oct 20, 2026 00:42157,38969,130,94357,027,0001,207,0002,113,536
5Oct 20, 2026 00:42158,55669,584,23557,545,0001,121,0002,113,536
6Oct 20, 2026 00:42159,58679,895,51557,634,0001,413,0002,113,536
7Oct 20, 2026 00:42161,35171,077,28058,501,0001,199,0002,113,536
8Oct 20, 2026 00:42179,60277,849,78558,228,0008,225,0002,113,536
9Oct 20, 2026 00:42184,00279,368,96256,480,00011,601,0002,113,536