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 listMar 15, 2026 21:56Elijah KinElijah KinScore: 150,411Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 21:56148,57083,054,27410,994,00043,977,0002,519,040
2Mar 15, 2026 21:56148,60583,076,8637,997,00046,987,0002,260,992
3Mar 15, 2026 21:56148,68682,904,45317,004,00038,010,0002,519,040
4Mar 15, 2026 21:56149,12482,163,41112,038,00043,138,0002,519,040
5Mar 15, 2026 21:56150,41184,758,22013,154,00042,498,0002,260,992
6Mar 15, 2026 21:56150,57390,538,48719,246,00036,466,0002,322,432
7Mar 15, 2026 21:56151,01180,633,71010,975,00044,899,0002,256,896
8Mar 15, 2026 21:56151,04986,224,42115,968,00039,920,0002,322,432
9Mar 15, 2026 21:56151,25181,749,62617,988,00037,975,0002,519,040