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 listMar 22, 2026 17:16Dominique GarmierDominique GarmierScore: 68,188Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 22, 2026 19:4667,7342,264,244,2132,222,222,00012,995,0002,334,720
2Mar 22, 2026 19:4667,8282,266,466,4492,220,340,00017,994,0002,342,912
3Mar 22, 2026 17:1668,1062,279,409,3752,229,497,00017,987,0002,342,912
4Mar 22, 2026 17:1668,1882,277,572,0372,238,198,00011,995,0002,342,912
5Mar 22, 2026 19:4668,4752,288,653,0762,247,674,00011,992,0002,330,624
6Mar 22, 2026 17:1668,6972,295,987,8652,251,999,00014,993,0002,342,912