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 01:11anboto1anboto1Score: 9,777Success
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 01:129,663328,121,142306,170,00012,721,0002,117,632
2Jun 8, 2026 01:129,667328,437,242306,410,00012,602,0002,117,632
3Jun 8, 2026 01:129,735330,645,166308,515,00012,766,0002,117,632
4Jun 8, 2026 01:129,765331,722,085310,260,00011,993,0002,117,632
5Jun 8, 2026 01:129,777331,969,366310,571,00012,081,0002,117,632
6Jun 8, 2026 01:129,824333,482,223311,464,00012,728,0002,117,632
7Jun 8, 2026 01:129,841334,411,506312,075,00012,681,0002,117,632
8Jun 8, 2026 01:129,843334,084,937312,237,00012,601,0002,117,632
9Jun 8, 2026 01:129,885335,437,154314,117,00012,115,0002,117,632