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 listAug 13, 2025 01:05Leon ZhaoLeon ZhaoScore: 15,505Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2025 01:0515,485537,491,227500,035,00010,978,0002,506,752
2Aug 13, 2025 01:0515,491535,178,167502,217,0008,986,0002,400,256
3Aug 13, 2025 01:0515,492539,423,371497,263,00013,979,0002,506,752
4Aug 13, 2025 01:0515,494536,020,732500,322,00010,985,0002,506,752
5Aug 13, 2025 01:0515,505543,464,950502,656,0008,993,0002,469,888
6Aug 13, 2025 01:0515,530540,894,218497,511,00014,985,0002,359,296
7Aug 13, 2025 01:0515,567541,530,521501,708,00011,993,0002,383,872
8Aug 13, 2025 01:0515,605545,820,019503,984,00010,977,0002,465,792
9Aug 13, 2025 01:0515,651540,336,157502,490,00013,985,0002,469,888