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 listOct 17, 2026 09:53KacpxerKacpxerScore: 19,612Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 17, 2026 09:5519,473653,488,745631,143,00011,470,0002,117,632
2Oct 17, 2026 09:5519,483653,917,924631,452,00011,499,0002,117,632
3Oct 17, 2026 09:5519,483653,966,894631,451,00011,509,0002,113,536
4Oct 17, 2026 09:5519,495654,310,626631,790,00011,567,0002,117,632
5Oct 17, 2026 09:5519,612658,166,305635,830,00011,386,0002,113,536
6Oct 17, 2026 09:5519,626658,554,084636,203,00011,473,0002,113,536
7Oct 17, 2026 09:5519,637658,896,644636,583,00011,449,0002,113,536
8Oct 17, 2026 09:5519,711661,588,004638,942,00011,551,0002,117,632
9Oct 17, 2026 09:5520,018677,319,474648,985,00011,633,0002,117,632