Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

Count the exact number of unique tokens as fast as possible.

Input

One token per line on STDIN:

JWXcKKaWzvFL5
Rof
3ztCpA
5wHcGN
*UiEMthaTS*g

Output

Print the exact count of unique tokens to STDOUT.

Constraints

  • Character set: 0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ@#%*
  • Maximum token length: 16
  • Approximately 1,000,000 unique tokens
Back to listOct 14, 2026 00:27highload-churnerhighload-churnerScore: 4,069Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Oct 15, 2026 17:50Andrew Epstein10.00CustomSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 14, 2026 00:283,960118,824,875106,524,0003,048,00049,152stderr
2Oct 14, 2026 00:284,008120,267,430108,042,0003,030,00049,152stderr
3Oct 14, 2026 00:284,024120,720,481108,531,0003,012,00049,152stderr
4Oct 14, 2026 00:284,031120,937,641108,655,0003,025,00049,152stderr
5Oct 14, 2026 00:284,069122,094,735109,879,0003,048,00049,152stderr
6Oct 14, 2026 00:284,093122,792,878110,051,0003,022,00049,152stderr
7Oct 14, 2026 00:284,270128,114,030116,870,0002,044,00049,152stderr
8Oct 14, 2026 00:284,300129,020,440116,727,0003,028,00049,152stderr
9Oct 14, 2026 00:284,429132,887,815118,667,0003,052,00049,152stderr