Unique strings Sergey Svistunov

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 07:19olliecrowolliecrowScore: 10,049Success
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 07:239,979358,109,254324,292,0005,004,0002,289,664
2Mar 22, 2026 07:199,999352,331,981323,976,0005,999,0002,486,272
3Mar 22, 2026 07:2310,027352,716,533324,907,0005,998,0002,318,336
4Mar 22, 2026 07:1910,049359,830,974328,636,0002,996,0002,478,080
5Mar 22, 2026 07:2310,077361,358,129327,536,0004,992,0002,482,176
6Mar 22, 2026 07:1910,429370,142,563343,167,0001,000,0002,281,472