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 listOct 31, 2026 00:55Andrew EpsteinAndrew EpsteinScore: 2,793Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 31, 2026 01:012,751101,577,07788,744,0002,040,0002,129,920
2Oct 31, 2026 01:012,754101,663,71788,789,0002,116,0002,129,920
3Oct 31, 2026 01:012,781102,824,24489,664,0002,117,0002,129,920
4Oct 31, 2026 01:012,783102,504,47189,798,0002,054,0002,129,920
5Oct 31, 2026 01:012,793102,934,40290,149,0002,050,0002,129,920
6Oct 31, 2026 01:012,805103,271,58090,538,0002,040,0002,174,976
7Oct 31, 2026 01:012,807103,316,81490,561,0002,077,0002,174,976
8Oct 31, 2026 01:012,815103,533,96190,836,0002,069,0002,174,976
9Oct 31, 2026 01:012,889106,047,26994,277,0001,060,0002,129,920