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 7, 2026 03:02Victor MerckléVictor MerckléScore: 6,607Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 03:036,576224,716,593179,582,00037,436,0002,113,536
2Jun 7, 2026 03:036,577226,124,798179,627,00037,442,0002,113,536
3Jun 7, 2026 03:036,591225,187,047180,091,00037,418,0002,113,536
4Jun 7, 2026 03:036,604226,242,794180,504,00037,430,0002,113,536
5Jun 7, 2026 03:036,607225,785,710180,772,00037,288,0002,113,536
6Jun 7, 2026 03:036,615227,377,452180,916,00037,405,0002,113,536
7Jun 7, 2026 03:036,615225,976,517180,901,00037,402,0002,113,536
8Jun 7, 2026 03:036,654227,351,523182,266,00037,316,0002,113,536
9Jun 7, 2026 03:036,697228,755,546183,825,00037,179,0002,113,536