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 listOct 12, 2025 03:14Marco BarboneMarco BarboneScore: 49,688Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 12, 2025 03:1449,4431,659,664,2411,615,649,00015,986,0002,277,376
2Oct 12, 2025 03:1449,6881,669,154,6601,623,705,00015,987,0002,326,528
3Oct 12, 2025 03:1450,0761,689,940,9921,640,513,00011,989,0002,371,584