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 listJul 2, 2026 03:28Genos0Genos0Score: 202,492Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2026 03:30201,0076,643,396,5456,578,710,00054,523,0002,113,536
2Jul 2, 2026 03:30201,3836,655,684,3756,595,281,00050,371,0002,113,536
3Jul 2, 2026 03:30201,5906,662,570,5546,594,076,00058,426,0002,113,536
4Jul 2, 2026 03:30201,8866,672,598,1066,612,360,00049,881,0002,113,536
5Jul 2, 2026 03:30202,4926,692,361,1486,632,056,00050,193,0002,113,536
6Jul 2, 2026 03:30203,0166,709,235,6546,644,952,00054,580,0002,113,536
7Jul 2, 2026 03:30203,0916,711,696,1666,648,184,00053,839,0002,113,536
8Jul 2, 2026 03:30203,4976,725,524,5446,666,153,00049,267,0002,113,536
9Jul 2, 2026 03:30204,0096,742,391,3436,682,908,00049,398,0002,113,536