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 17:49boop34boop34Score: 13,641Success
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 17:5013,613459,050,676444,199,0005,050,0002,113,536
2Jul 23, 2026 17:5013,627459,551,847444,505,0005,206,0002,113,536
3Jul 23, 2026 17:5013,633459,715,550444,812,0005,086,0002,113,536
4Jul 23, 2026 17:5013,639459,867,438445,030,0005,079,0002,113,536
5Jul 23, 2026 17:5013,641460,051,019444,842,0005,319,0002,113,536
6Jul 23, 2026 17:5013,655460,458,385445,508,0005,137,0002,113,536
7Jul 23, 2026 17:5013,657460,525,494445,487,0005,207,0002,113,536
8Jul 23, 2026 17:5013,657460,446,848445,479,0005,226,0002,113,536
9Jul 23, 2026 17:5014,606491,862,712477,063,0004,946,0002,113,536