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 9, 2026 21:20highload-churnerhighload-churnerScore: 33,980Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2026 21:4233,9591,018,786,413724,522,000281,948,00045,056
2Oct 9, 2026 21:4233,9641,018,937,346724,952,000281,766,00045,056
3Oct 9, 2026 21:4233,9651,018,954,050724,133,000282,610,00045,056
4Oct 9, 2026 21:4233,9711,019,132,523724,903,000281,750,00045,056
5Oct 9, 2026 21:4233,9801,019,412,625724,512,000282,636,00045,056
6Oct 9, 2026 21:4233,9961,019,892,144722,982,000284,500,00045,056
7Oct 9, 2026 21:4234,0291,020,897,710726,712,000281,732,00049,152
8Oct 9, 2026 21:4234,0321,020,961,622724,033,000282,585,00045,056
9Oct 9, 2026 21:4234,0621,021,876,352725,031,000284,662,00045,056