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 12:40anboto1anboto1Score: 26,506Success
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 12:4126,335878,874,091862,368,0006,692,0002,113,536
2Jun 8, 2026 12:4126,357879,182,479863,050,0006,742,0002,113,536
3Jun 8, 2026 12:4126,367879,453,825863,409,0006,703,0002,113,536
4Jun 8, 2026 12:4126,478883,073,300867,121,0006,668,0002,113,536
5Jun 8, 2026 12:4126,506884,109,160867,967,0006,731,0002,117,632
6Jun 8, 2026 12:4126,637890,130,897872,339,0006,700,0002,113,536
7Jun 8, 2026 12:4126,770892,746,917876,512,0006,924,0002,113,536
8Jun 8, 2026 12:4128,010934,168,010917,514,0006,817,0002,113,536
9Jun 8, 2026 12:4128,021933,984,322917,800,0006,904,0002,113,536