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:53Tomislav TunkovicTomislav TunkovicScore: 57,448Success
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:5457,33729,574,76721,215,00002,117,632stderr
2Aug 14, 2026 22:5457,34529,592,30320,200,0001,018,0002,117,632stderr
3Aug 14, 2026 22:5457,38129,529,13221,231,00002,117,632stderr
4Aug 14, 2026 22:5457,44330,752,60220,191,0001,063,0002,117,632stderr
5Aug 14, 2026 22:5457,44829,694,46120,232,0001,024,0002,117,632stderr
6Aug 14, 2026 22:5457,46429,633,30420,221,0001,041,0002,117,632stderr
7Aug 14, 2026 22:5457,48129,616,24020,245,0001,023,0002,117,632stderr
8Aug 14, 2026 22:5457,51329,677,60820,244,0001,036,0002,117,632stderr
9Aug 14, 2026 22:5457,54329,701,86220,257,0001,034,0002,117,632stderr