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 listJul 23, 2026 16:41boop34boop34Score: 19,884Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 23, 2026 16:4219,772662,229,238649,470,0003,022,0002,113,536
2Jul 23, 2026 16:4219,773663,969,131649,500,0003,038,0002,113,536
3Jul 23, 2026 16:4219,808663,428,223650,705,0002,991,0002,113,536
4Jul 23, 2026 16:4219,842664,622,007651,782,0003,024,0002,113,536
5Jul 23, 2026 16:4219,884665,874,684653,168,0003,005,0002,113,536
6Jul 23, 2026 16:4219,894666,333,615653,449,0003,062,0002,113,536
7Jul 23, 2026 16:4220,099673,115,192660,209,0003,075,0002,113,536
8Jul 23, 2026 16:4220,211676,743,168663,918,0003,057,0002,113,536
9Jul 23, 2026 16:4220,307679,971,415666,941,0003,216,0002,113,536