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 9, 2026 21:00Pavel SamyginPavel SamyginScore: 12,977Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 9, 2026 21:0012,780448,107,961412,746,0008,994,0002,383,872
2Mar 9, 2026 21:0012,889448,262,032416,339,0008,985,0002,363,392
3Mar 9, 2026 21:0012,895447,431,754416,536,0008,989,0002,375,680
4Mar 9, 2026 21:0012,963451,971,704418,785,0008,995,0002,416,640
5Mar 9, 2026 21:0012,977450,426,715420,244,0008,004,0002,461,696
6Mar 9, 2026 21:0012,986452,737,704419,541,0008,990,0002,379,776
7Mar 9, 2026 21:0013,056457,315,964421,849,0008,996,0002,371,584
8Mar 9, 2026 21:0013,056450,725,943421,860,0008,997,0002,379,776
9Mar 9, 2026 21:0013,076457,761,951422,532,0008,990,0002,375,680