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 31, 2026 14:55CodeReclaimersCodeReclaimersScore: 12,731Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 14:5612,362418,051,037402,210,0005,742,0002,113,536
2Jul 31, 2026 14:5612,395419,139,781403,338,0005,727,0002,113,536
3Jul 31, 2026 14:5612,397419,146,849403,224,0005,892,0002,113,536
4Jul 31, 2026 14:5612,616426,349,092410,473,0005,860,0002,113,536
5Jul 31, 2026 14:5612,731430,309,430414,232,0005,902,0002,113,536
6Jul 31, 2026 14:5612,805432,772,589416,536,0006,053,0002,113,536
7Jul 31, 2026 14:5612,885436,120,198419,203,0006,010,0002,113,536
8Jul 31, 2026 14:5612,911437,125,365420,035,0006,057,0002,113,536
9Jul 31, 2026 14:5613,558472,754,121441,390,0006,050,0002,113,536