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 16:50Josu San MartinJosu San MartinScore: 3,463Success
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 16:513,436124,995,222112,341,0001,059,0002,113,536
2May 13, 2026 16:513,439122,362,822112,473,0001,046,0002,113,536
3May 13, 2026 16:513,456123,460,658113,002,0001,052,0002,113,536
4May 13, 2026 16:513,458123,305,871113,086,0001,044,0002,113,536
5May 13, 2026 16:513,463123,158,559113,271,0001,036,0002,113,536
6May 13, 2026 16:513,464124,134,310113,258,0001,061,0002,113,536
7May 13, 2026 16:513,465125,998,437113,314,0001,056,0002,113,536
8May 13, 2026 16:513,471124,389,831113,520,0001,034,0002,113,536
9May 13, 2026 16:513,483125,382,209113,911,0001,047,0002,113,536