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 listMay 13, 2026 04:43Josu San MartinJosu San MartinScore: 3,514Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 04:443,507125,090,508114,672,0001,068,0002,113,536
2May 13, 2026 04:443,510124,589,950114,802,0001,060,0002,113,536
3May 13, 2026 04:443,510126,224,463114,773,0001,069,0002,113,536
4May 13, 2026 04:443,511124,647,012114,844,0001,047,0002,113,536
5May 13, 2026 04:443,514125,146,186114,895,0001,068,0002,113,536
6May 13, 2026 04:443,514124,981,491114,918,0001,076,0002,113,536
7May 13, 2026 04:443,516126,672,094114,968,0001,068,0002,113,536
8May 13, 2026 04:443,521124,932,173115,078,0001,124,0002,113,536
9May 13, 2026 04:443,524127,090,941115,251,0001,070,0002,113,536