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 8, 2026 14:02anboto1anboto1Score: 5,501Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 14:035,474189,827,076171,437,0009,209,0002,117,632
2Jun 8, 2026 14:035,475190,501,597171,461,0009,246,0002,117,632
3Jun 8, 2026 14:035,489190,872,669171,855,0009,283,0002,117,632
4Jun 8, 2026 14:035,498190,619,320172,303,0009,142,0002,117,632
5Jun 8, 2026 14:035,501191,254,665172,324,0009,239,0002,117,632
6Jun 8, 2026 14:035,511191,542,425173,623,0008,266,0002,117,632
7Jun 8, 2026 14:035,545192,709,970173,651,0009,335,0002,117,632
8Jun 8, 2026 14:035,553192,903,191173,930,0009,332,0002,117,632
9Jun 8, 2026 14:035,563192,841,885174,220,0009,359,0002,117,632