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 12, 2026 01:20Victor MerckléVictor MerckléScore: 6,658Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 12, 2026 01:216,622226,617,791180,903,00037,629,0002,113,536
2May 12, 2026 01:216,622225,865,779180,033,00038,510,0002,113,536
3May 12, 2026 01:216,630229,112,956180,142,00038,656,0002,113,536
4May 12, 2026 01:216,636226,358,381180,355,00038,650,0002,113,536
5May 12, 2026 01:216,658229,408,051182,047,00037,694,0002,113,536
6May 12, 2026 01:216,667227,526,378181,432,00038,595,0002,113,536
7May 12, 2026 01:216,707228,787,948183,813,00037,547,0002,113,536
8May 12, 2026 01:216,757232,017,007184,408,00038,601,0002,113,536
9May 12, 2026 01:216,759232,079,606185,571,00037,501,0002,113,536