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 14:49Josu San MartinJosu San MartinScore: 3,428Success
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 14:503,424123,761,909111,942,0001,058,0002,113,536
2May 13, 2026 14:503,425124,767,037112,001,0001,047,0002,113,536
3May 13, 2026 14:503,425123,814,715111,993,0001,061,0002,113,536
4May 13, 2026 14:503,427122,560,803112,046,0001,056,0002,113,536
5May 13, 2026 14:503,428124,304,607112,078,0001,047,0002,113,536
6May 13, 2026 14:503,429123,557,444112,122,0001,056,0002,113,536
7May 13, 2026 14:503,452125,506,464112,862,0001,061,0002,113,536
8May 13, 2026 14:503,457122,977,131113,060,0001,052,0002,113,536
9May 13, 2026 14:503,467125,660,955113,376,0001,061,0002,113,536