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 listJan 7, 2026 22:26Josu San MartinJosu San MartinScore: 14,001Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 7, 2026 22:2613,536476,160,800445,685,000999,0002,351,104
2Jan 7, 2026 22:2613,549471,502,042445,128,0002,000,0002,351,104
3Jan 7, 2026 22:2613,804485,244,616453,533,0001,997,0002,289,664
4Jan 7, 2026 22:2613,828485,876,133451,335,0004,992,0002,355,200
5Jan 7, 2026 22:2614,001489,640,046459,035,0003,000,0002,351,104
6Jan 7, 2026 22:2614,210500,567,667466,926,0001,999,0002,334,720
7Jan 7, 2026 22:2614,231494,658,202467,628,0001,998,0002,289,664
8Jan 7, 2026 22:2614,261497,182,174467,601,0002,997,0002,347,008
9Jan 7, 2026 22:2614,386510,181,693472,737,0001,998,0002,334,720