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 14, 2026 09:36Josu San MartinJosu San MartinScore: 3,355Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 09:373,352122,005,637109,573,0001,046,0002,113,536
2May 14, 2026 09:373,352119,953,920109,595,0001,042,0002,113,536
3May 14, 2026 09:373,353121,280,914109,598,0001,056,0002,113,536
4May 14, 2026 09:373,353119,406,891109,618,0001,042,0002,113,536
5May 14, 2026 09:373,355121,361,828109,688,0001,040,0002,113,536
6May 14, 2026 09:373,356120,963,261109,723,0001,053,0002,113,536
7May 14, 2026 09:373,359119,629,925109,812,0001,035,0002,113,536
8May 14, 2026 09:373,366121,747,488110,040,0001,055,0002,113,536
9May 14, 2026 09:373,367120,052,947110,049,0001,063,0002,113,536