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:35anboto1anboto1Score: 10,739Success
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:3610,635362,268,437338,970,00011,998,0002,117,632
2Jun 8, 2026 00:3610,676362,133,800340,268,00012,054,0002,117,632
3Jun 8, 2026 00:3610,677362,107,102340,347,00012,007,0002,117,632
4Jun 8, 2026 00:3610,730363,841,541342,007,00012,109,0002,117,632
5Jun 8, 2026 00:3610,739365,633,949342,294,00012,098,0002,117,632
6Jun 8, 2026 00:3610,776365,269,962343,556,00012,079,0002,117,632
7Jun 8, 2026 00:3610,827367,210,007345,095,00012,218,0002,117,632
8Jun 8, 2026 00:3610,854368,100,924346,106,00012,103,0002,117,632
9Jun 8, 2026 00:3610,867368,009,204346,561,00012,068,0002,117,632