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 7, 2026 19:29anboto1anboto1Score: 14,777Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 19:3014,669493,420,923461,262,00022,815,0002,113,536
2Jun 7, 2026 19:3014,727495,376,847463,490,00022,529,0002,113,536
3Jun 7, 2026 19:3014,742495,794,274463,879,00022,612,0002,113,536
4Jun 7, 2026 19:3014,747496,069,051463,928,00022,738,0002,113,536
5Jun 7, 2026 19:3014,777496,927,610464,952,00022,716,0002,113,536
6Jun 7, 2026 19:3014,782500,644,954465,179,00022,643,0002,113,536
7Jun 7, 2026 19:3014,789497,632,635465,131,00022,929,0002,113,536
8Jun 7, 2026 19:3014,805498,558,082466,244,00022,351,0002,113,536
9Jun 7, 2026 19:3014,835498,831,178466,874,00022,684,0002,113,536