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 listJun 28, 2026 09:57Victor MerckléVictor MerckléScore: 3,323Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2026 09:583,318117,978,299108,326,0001,168,0002,113,536
2Jun 28, 2026 09:583,319117,648,016108,369,0001,190,0002,113,536
3Jun 28, 2026 09:583,319117,650,349108,366,0001,193,0002,113,536
4Jun 28, 2026 09:583,320117,973,209108,418,0001,172,0002,113,536
5Jun 28, 2026 09:583,323117,756,500108,498,0001,190,0002,113,536
6Jun 28, 2026 09:583,324117,930,255108,538,0001,172,0002,113,536
7Jun 28, 2026 09:583,332118,044,384108,743,0001,215,0002,113,536
8Jun 28, 2026 09:583,334117,811,450108,856,0001,181,0002,113,536
9Jun 28, 2026 09:583,351118,796,991109,386,0001,216,0002,113,536