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 21:49Josu San MartinJosu San MartinScore: 14,634Success
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 21:4914,136491,938,147463,485,0002,996,0002,289,664
2Jan 7, 2026 21:4914,201494,430,108465,621,0002,997,0002,347,008
3Jan 7, 2026 21:4914,301499,638,026469,933,0001,999,0002,289,664
4Jan 7, 2026 21:4914,518504,627,372477,079,0002,000,0002,326,528
5Jan 7, 2026 21:4914,634507,788,634479,936,0002,999,0002,289,664
6Jan 7, 2026 21:4914,742513,579,596482,490,0003,995,0002,342,912
7Jan 7, 2026 21:4914,969529,754,906491,979,0001,999,0002,347,008
8Jan 7, 2026 21:4915,457532,589,548508,079,0002,000,0002,289,664
9Jan 7, 2026 21:4917,304603,007,766568,017,0003,000,0002,289,664