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:54boop34boop34Score: 11,745Success
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:5511,655394,446,398376,011,0008,613,0002,113,536
2Jul 23, 2026 16:5511,672394,945,940376,391,0008,806,0002,113,536
3Jul 23, 2026 16:5511,732396,924,192378,007,0009,157,0002,113,536
4Jul 23, 2026 16:5511,737397,133,292378,622,0008,720,0002,113,536
5Jul 23, 2026 16:5511,745397,444,424378,499,0009,096,0002,113,536
6Jul 23, 2026 16:5511,761397,969,964379,148,0008,993,0002,113,536
7Jul 23, 2026 16:5511,762398,007,407378,977,0009,191,0002,113,536
8Jul 23, 2026 16:5511,778398,437,730379,595,0009,084,0002,113,536
9Jul 23, 2026 16:5511,786399,077,260379,866,0009,101,0002,113,536