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 24, 2026 05:38Victor MerckléVictor MerckléScore: 4,914Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 05:394,904169,490,137125,238,00036,614,0002,113,536
2Jun 24, 2026 05:394,906169,433,869125,163,00036,739,0002,113,536
3Jun 24, 2026 05:394,907169,505,685125,236,00036,714,0002,113,536
4Jun 24, 2026 05:394,911169,732,889125,399,00036,684,0002,113,536
5Jun 24, 2026 05:394,914170,082,229125,396,00036,782,0002,113,536
6Jun 24, 2026 05:394,922170,912,182125,698,00036,728,0002,113,536
7Jun 24, 2026 05:394,942170,985,133125,255,00037,863,0002,113,536
8Jun 24, 2026 05:394,943171,034,373125,306,00037,820,0002,113,536
9Jun 24, 2026 05:394,966171,943,630125,951,00037,940,0002,113,536