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 listNov 6, 2025 07:40izotoffizotoffScore: 230,118Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 6, 2025 07:40228,6327,574,023,9957,413,947,000130,910,0002,519,040
2Nov 6, 2025 07:40228,8237,577,705,8737,420,244,000130,916,0002,490,368
3Nov 6, 2025 07:40229,7137,611,732,2837,426,650,000153,889,0002,449,408
4Nov 6, 2025 07:40229,7757,617,575,7747,431,697,000150,892,0002,330,624
5Nov 6, 2025 07:40230,1187,633,846,2287,452,923,000140,960,0002,330,624
6Nov 6, 2025 07:40230,4717,638,156,6357,461,656,000143,896,0002,314,240
7Nov 6, 2025 07:40231,5857,667,579,3537,507,358,000134,934,0002,433,024
8Nov 6, 2025 07:40232,0247,686,042,1887,524,835,000131,944,0002,347,008
9Nov 6, 2025 07:40232,5277,701,887,7177,538,487,000134,919,0002,416,640