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 listAug 13, 2026 19:18Tomislav TunkovicTomislav TunkovicScore: 5,728Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2026 19:195,701196,671,825183,890,0004,261,0002,121,728stderr
2Aug 13, 2026 19:195,706196,694,036183,841,0004,463,0002,121,728stderr
3Aug 13, 2026 19:195,714196,760,786184,109,0004,456,0002,121,728stderr
4Aug 13, 2026 19:195,716197,090,633184,458,0004,198,0002,121,728stderr
5Aug 13, 2026 19:195,728197,362,150184,621,0004,418,0002,121,728stderr
6Aug 13, 2026 19:195,733197,663,430184,972,0004,247,0002,121,728stderr
7Aug 13, 2026 19:195,785200,458,691186,457,0004,464,0002,121,728stderr
8Aug 13, 2026 19:195,810199,953,666187,403,0004,328,0002,121,728stderr
9Aug 13, 2026 19:195,886202,673,418189,960,0004,298,0002,121,728stderr