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 8, 2026 11:26anboto1anboto1Score: 5,518Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 8, 2026 11:275,509191,113,951172,650,0009,179,0002,117,632
2Jun 8, 2026 11:275,512191,653,654172,651,0009,269,0002,117,632
3Jun 8, 2026 11:275,513191,236,881172,596,0009,347,0002,117,632
4Jun 8, 2026 11:275,515191,158,468172,782,0009,221,0002,117,632
5Jun 8, 2026 11:275,518191,434,902172,879,0009,234,0002,117,632
6Jun 8, 2026 11:275,549194,091,593173,902,0009,219,0002,117,632
7Jun 8, 2026 11:275,554192,615,292173,938,0009,349,0002,117,632
8Jun 8, 2026 11:275,590193,635,383175,235,0009,235,0002,117,632
9Jun 8, 2026 11:275,605194,289,629175,617,0009,366,0002,117,632