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 26, 2026 16:34boop34boop34Score: 6,717Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 26, 2026 16:356,661231,031,116216,834,0002,984,0002,113,536
2Jul 26, 2026 16:356,668230,907,776216,731,0003,324,0002,113,536
3Jul 26, 2026 16:356,701231,055,060217,129,0004,021,0002,113,536
4Jul 26, 2026 16:356,710231,468,546217,210,0004,239,0002,113,536
5Jul 26, 2026 16:356,717231,538,207217,554,0004,111,0002,117,632stderr
6Jul 26, 2026 16:356,724231,865,170217,456,0004,463,0002,113,536
7Jul 26, 2026 16:356,731232,241,528216,765,0005,388,0002,117,632stderr
8Jul 26, 2026 16:356,768233,245,457219,188,0004,173,0002,113,536
9Jul 26, 2026 16:356,784234,275,285220,201,0003,678,0002,113,536