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 listDec 15, 2025 15:22Pavitra GolchhaPavitra GolchhaScore: 142,139Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 15, 2025 15:22131,2476,776,049,1363,214,517,0001,116,622,000253,952
2Dec 15, 2025 15:22142,1398,072,717,5713,328,367,0001,362,234,0002,301,952
3Dec 15, 2025 15:22144,7268,106,321,2043,286,247,0001,489,725,0002,433,024