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 listJan 10, 2025 01:52Ian MckibbenIan MckibbenScore: 448,065Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2025 01:52435,69814,407,249,41514,353,063,00024,984,0002,420,736
2Jan 10, 2025 01:52448,06514,820,156,65614,756,152,00029,982,0002,355,200
3Jan 10, 2025 01:52448,28914,832,219,92914,760,557,00032,976,0002,469,888