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 23, 2024 01:31Joad NacerJoad NacerScore: 28,175Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2024 01:3128,042992,887,697925,400,76402,199,552
2Apr 23, 2024 01:3128,112992,205,513927,696,13602,191,360
3Apr 23, 2024 01:3128,1361,000,445,833928,471,64502,207,744
4Apr 23, 2024 01:3128,175984,918,557929,765,21802,195,456
5Apr 23, 2024 01:3128,291999,283,817933,592,19402,207,744
6Apr 23, 2024 01:3128,4631,011,864,392939,292,44102,203,648