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 00:09anboto1anboto1Score: 10,844Success
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 00:1010,736363,992,782341,677,00012,612,0002,117,632
2Jun 8, 2026 00:1010,798365,637,963343,601,00012,737,0002,117,632
3Jun 8, 2026 00:1010,805365,954,021343,943,00012,650,0002,117,632
4Jun 8, 2026 00:1010,809366,000,391344,056,00012,663,0002,117,632
5Jun 8, 2026 00:1010,844367,257,534345,201,00012,680,0002,117,632
6Jun 8, 2026 00:1010,847367,270,561345,358,00012,607,0002,117,632
7Jun 8, 2026 00:1010,857367,553,594345,542,00012,762,0002,117,632
8Jun 8, 2026 00:1010,907369,223,243347,187,00012,748,0002,117,632
9Jun 8, 2026 00:1010,929369,984,952348,550,00012,130,0002,117,632