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 listJan 9, 2026 14:54Josu San MartinJosu San MartinScore: 6,640Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 9, 2026 14:546,578244,310,312213,079,0004,001,0002,383,872
2Jan 9, 2026 14:546,620243,843,954213,480,0004,987,0002,371,584
3Jan 9, 2026 14:546,622249,257,671213,524,0004,988,0002,498,560
4Jan 9, 2026 14:546,637244,958,382215,019,0004,000,0002,498,560
5Jan 9, 2026 14:546,640241,972,541213,125,0006,003,0002,387,968
6Jan 9, 2026 14:546,641241,706,027214,156,0005,003,0002,293,760
7Jan 9, 2026 14:546,667251,948,882214,017,0006,000,0002,490,368
8Jan 9, 2026 14:546,668241,456,013217,029,0003,000,0002,502,656
9Jan 9, 2026 14:546,742257,849,183218,482,0003,990,0002,416,640