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 listAug 1, 2026 13:16CodeReclaimersCodeReclaimersScore: 7,041Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 13:176,800234,523,114220,222,0004,198,0002,113,536
2Aug 1, 2026 13:176,883237,907,792222,798,0004,348,0002,113,536
3Aug 1, 2026 13:176,974240,640,623226,047,0004,110,0002,113,536
4Aug 1, 2026 13:177,041243,240,452227,961,0004,413,0002,113,536
5Aug 1, 2026 13:177,041242,519,221227,907,0004,463,0002,113,536
6Aug 1, 2026 13:177,110244,934,652230,201,0004,458,0002,113,536
7Aug 1, 2026 13:177,170247,473,021232,105,0004,534,0002,113,536
8Aug 1, 2026 13:177,193248,264,675232,783,0004,589,0002,113,536
9Aug 1, 2026 13:177,220248,454,329233,739,0004,522,0002,113,536