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 listMay 13, 2026 04:40Josu San MartinJosu San MartinScore: 3,519Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 04:413,514126,934,880114,842,0001,122,0002,113,536
2May 13, 2026 04:413,514124,737,504114,910,0001,077,0002,113,536
3May 13, 2026 04:413,515124,801,958114,909,0001,111,0002,113,536
4May 13, 2026 04:413,518125,549,970115,001,0001,119,0002,113,536
5May 13, 2026 04:413,519125,590,186115,015,0001,116,0002,113,536
6May 13, 2026 04:413,520126,709,094115,062,0001,116,0002,113,536
7May 13, 2026 04:413,521126,516,062115,085,0001,126,0002,113,536
8May 13, 2026 04:413,523125,552,026115,159,0001,117,0002,113,536
9May 13, 2026 04:413,529126,556,530115,331,0001,136,0002,113,536