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 10, 2025 08:43Emanuele BolognesiEmanuele BolognesiScore: 98,046Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2025 08:4397,4873,250,690,0003,198,082,00018,988,0002,506,752
2May 10, 2025 08:4397,6353,251,072,3323,203,975,00017,988,0002,445,312
3May 10, 2025 08:4397,9173,260,268,3373,209,282,00021,988,0002,457,600
4May 10, 2025 08:4397,9873,264,313,6823,219,574,00013,993,0002,449,408
5May 10, 2025 08:4398,0463,263,566,9003,210,515,00024,988,0002,478,080
6May 10, 2025 08:4398,3703,276,172,1693,219,212,00026,985,0002,473,984
7May 10, 2025 08:4398,6823,282,349,6123,240,515,00015,992,0002,473,984
8May 10, 2025 08:43100,0173,334,218,6413,275,587,00024,989,0002,473,984
9May 10, 2025 08:43100,7443,351,762,9163,301,566,00022,983,0002,457,600