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 listAug 14, 2026 22:14Tomislav TunkovicTomislav TunkovicScore: 965,932Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 22:16963,281364,894,187355,326,0001,088,0002,117,632stderr
2Aug 14, 2026 22:16964,329365,170,975355,673,0001,129,0002,117,632stderr
3Aug 14, 2026 22:16965,191365,461,096355,996,0001,125,0002,117,632stderr
4Aug 14, 2026 22:16965,337365,549,620356,091,0001,084,0002,117,632stderr
5Aug 14, 2026 22:16965,932365,778,022356,390,0001,005,0002,117,632stderr
6Aug 14, 2026 22:16966,127365,880,338356,449,0001,018,0002,117,632stderr
7Aug 14, 2026 22:16966,456365,941,679356,478,0001,111,0002,117,632stderr
8Aug 14, 2026 22:16966,481367,077,359356,476,0001,122,0002,117,632stderr
9Aug 14, 2026 22:16968,629366,774,354357,274,0001,119,0002,117,632stderr