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 listJan 1, 2026 16:08zielajzielajScore: 3,554Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 16:083,462135,874,817112,250,0002,004,0002,273,280
2Jan 1, 2026 16:083,513142,222,408112,940,0002,998,0002,318,336
3Jan 1, 2026 16:083,520136,632,142114,167,0002,002,0002,273,280
4Jan 1, 2026 16:083,545138,805,779114,993,0001,999,0002,531,328
5Jan 1, 2026 16:083,554138,442,142115,286,0002,004,0002,334,720
6Jan 1, 2026 16:083,577142,353,729116,031,0002,000,0002,326,528
7Jan 1, 2026 16:083,580138,107,415116,125,0002,002,0002,318,336
8Jan 1, 2026 16:083,643142,381,727117,204,0003,005,0002,531,328
9Jan 1, 2026 16:083,659140,347,099116,763,0003,991,0002,330,624