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 25, 2025 00:46Emanuele BolognesiEmanuele BolognesiScore: 134,479Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 25, 2025 00:46134,2234,460,301,8094,406,374,00022,986,0002,363,392
2May 25, 2025 00:46134,4794,475,966,6954,414,813,00022,988,0002,469,888
3May 25, 2025 00:46135,8434,511,012,3084,460,831,00021,984,0002,265,088