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 21, 2025 18:01Ian MckibbenIan MckibbenScore: 113,263Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 21, 2025 18:01112,9173,755,178,0363,582,380,000143,894,0002,428,928
2Jun 21, 2025 18:01113,2633,767,604,1303,596,804,000140,874,0002,506,752
3Jun 21, 2025 18:01113,3643,766,112,6183,611,121,000129,896,0002,297,856