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 16:34boop34boop34Score: 11,911Success
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 16:3511,799399,124,322380,525,0008,845,0002,113,536
2Jul 23, 2026 16:3511,859401,175,909382,531,0008,838,0002,113,536
3Jul 23, 2026 16:3511,875401,642,329382,791,0009,114,0002,113,536
4Jul 23, 2026 16:3511,906402,681,590384,270,0008,644,0002,113,536
5Jul 23, 2026 16:3511,911402,820,579384,395,0008,674,0002,113,536
6Jul 23, 2026 16:3511,912402,911,728384,407,0008,695,0002,113,536
7Jul 23, 2026 16:3511,926403,605,011384,406,0009,168,0002,113,536
8Jul 23, 2026 16:3511,952404,380,124385,141,0009,298,0002,113,536
9Jul 23, 2026 16:3511,953404,439,049385,379,0009,076,0002,113,536