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 listApr 30, 2024 19:10Joad NacerJoad NacerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2024 19:1000000Error: expected "1018399 ", got "1018398 "stderr
2Apr 30, 2024 19:1019,726708,459,900650,967,02702,265,088
3Apr 30, 2024 19:1019,895716,686,470656,522,50302,277,376
4Apr 30, 2024 19:1020,277741,573,721669,127,72502,265,088