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 16, 2026 23:12Tomislav TunkovicTomislav TunkovicScore: 3,622Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 04:423,557127,390,440116,374,0001,016,00024,576
2Aug 17, 2026 04:423,612129,148,926118,176,0001,020,00024,576
3Aug 17, 2026 04:423,615129,167,905118,299,0001,024,00024,576
4Aug 17, 2026 04:423,616129,240,671118,324,0001,036,00024,576
5Aug 17, 2026 04:423,622130,180,686118,503,0001,031,00024,576
6Aug 17, 2026 04:423,623129,437,102118,534,0001,027,00024,576
7Aug 17, 2026 04:423,626129,582,863118,640,0001,019,00024,576
8Aug 17, 2026 04:423,627129,568,635118,669,0001,026,00024,576
9Aug 17, 2026 04:423,639129,966,214119,065,0001,028,00024,576