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 23, 2025 04:17Ian MckibbenIan MckibbenScore: 506,808Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 23, 2025 04:17494,57316,360,750,18616,220,966,00099,938,0002,437,120
2Jun 23, 2025 04:17506,80816,761,052,06616,616,723,000107,926,0002,326,528
3Jun 23, 2025 04:17521,66217,253,339,70817,121,907,00092,928,0002,322,432