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 listJan 12, 2026 03:57Josu San MartinJosu San MartinScore: 4,324Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 03:574,324169,120,730140,683,0001,995,0002,392,064
2Jan 12, 2026 03:574,324168,879,321139,686,0002,993,0002,289,664
3Jan 12, 2026 03:574,324170,797,345140,695,0001,995,0002,289,664
4Jan 12, 2026 03:574,324170,760,821140,708,0001,995,0002,404,352
5Jan 12, 2026 03:574,324174,870,271141,707,000997,0002,392,064
6Jan 12, 2026 03:574,329168,231,361140,858,0001,997,0002,404,352
7Jan 12, 2026 03:574,330166,608,299140,882,0001,998,0002,289,664
8Jan 12, 2026 03:574,330171,807,817140,898,0001,998,0002,289,664
9Jan 12, 2026 03:574,365170,780,616141,048,0003,001,0002,289,664