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 listJun 7, 2024 19:08GraceGraceScore: 535,083Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2024 19:08530,25417,561,015,67117,498,373,56802,240,512
2Jun 7, 2024 19:08533,06617,659,378,78317,591,179,18202,273,280
3Jun 7, 2024 19:08534,14017,693,437,26517,626,609,11102,269,184
4Jun 7, 2024 19:08535,08317,724,247,47717,657,741,98902,203,648
5Jun 7, 2024 19:08538,47817,829,150,16717,769,759,16002,306,048
6Jun 7, 2024 19:08541,20617,914,153,06317,859,782,45702,207,744