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 1, 2026 22:52zielajzielajScore: 3,504Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 2, 2026 11:493,478138,616,853108,785,0005,988,0002,338,816
2Jan 1, 2026 22:593,496137,590,022108,347,0007,022,0002,347,008
3Jan 2, 2026 11:493,498142,625,307107,399,0008,029,0002,420,736
4Jan 1, 2026 22:593,501141,552,528108,491,0007,031,0002,342,912
5Jan 1, 2026 22:523,504141,346,426106,655,0008,970,0002,347,008
6Jan 1, 2026 22:523,504138,778,225107,670,0007,975,0002,342,912
7Jan 1, 2026 22:593,506145,619,033108,720,0006,982,0002,473,984
8Jan 2, 2026 11:493,531141,304,622107,493,0009,041,0002,342,912
9Jan 1, 2026 22:523,562143,884,621110,499,0007,031,0002,326,528