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 listMar 22, 2026 22:35Dominique GarmierDominique GarmierScore: 9,100Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 22:358,843265,281,010678,347,0007,003,0002,478,080
2Mar 22, 2026 22:358,950268,508,502674,536,00010,992,0002,654,208
3Mar 22, 2026 22:359,043271,295,125680,149,00010,002,0002,437,120
4Mar 22, 2026 22:359,100272,998,266675,725,00010,010,0002,572,288
5Mar 22, 2026 22:359,123273,679,433673,801,0009,010,0002,527,232
6Mar 22, 2026 22:359,393281,793,968712,415,0006,994,0002,498,560