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 22:13anboto1anboto1Score: 11,441Success
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 22:1411,302385,671,895360,827,00012,157,0002,117,632
2Jun 7, 2026 22:1411,381384,893,484362,818,00012,768,0002,117,632
3Jun 7, 2026 22:1411,402385,615,471363,418,00012,877,0002,117,632
4Jun 7, 2026 22:1411,426386,858,725364,824,00012,241,0002,117,632
5Jun 7, 2026 22:1411,441386,949,929364,841,00012,728,0002,117,632
6Jun 7, 2026 22:1411,456387,386,034365,293,00012,760,0002,117,632
7Jun 7, 2026 22:1411,493389,119,496367,125,00012,161,0002,117,632
8Jun 7, 2026 22:1411,498388,802,234366,631,00012,825,0002,117,632
9Jun 7, 2026 22:1411,518389,297,165367,260,00012,862,0002,117,632