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 18:03boop34boop34Score: 11,726Success
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 18:0411,620393,120,121374,865,0008,596,0002,113,536
2Jul 23, 2026 18:0411,671396,478,317376,295,0008,864,0002,113,536
3Jul 23, 2026 18:0411,688395,473,358377,287,0008,425,0002,113,536
4Jul 23, 2026 18:0411,706396,035,871377,514,0008,785,0002,113,536
5Jul 23, 2026 18:0411,726396,721,519377,412,0009,563,0002,113,536
6Jul 23, 2026 18:0411,727396,821,089377,844,0009,172,0002,113,536
7Jul 23, 2026 18:0411,747397,489,893378,794,0008,885,0002,113,536
8Jul 23, 2026 18:0411,762397,975,990379,100,0009,076,0002,113,536
9Jul 23, 2026 18:0411,882401,906,193383,052,0009,056,0002,113,536