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 17, 2026 06:56marko1597marko1597Score: 6,978Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 06:586,897235,967,153220,138,0007,486,0002,121,728stderr
2Aug 17, 2026 06:586,954237,793,570222,175,0007,307,0002,121,728stderr
3Aug 17, 2026 06:586,960239,353,245222,364,0007,343,0002,121,728stderr
4Aug 17, 2026 06:586,973238,448,249222,771,0007,366,0002,121,728stderr
5Aug 17, 2026 06:586,978238,561,501222,928,0007,360,0002,121,728stderr
6Aug 17, 2026 06:586,983238,738,539223,000,0007,450,0002,121,728stderr
7Aug 17, 2026 06:586,998240,163,002223,490,0007,452,0002,121,728stderr
8Aug 17, 2026 06:586,999240,058,247223,616,0007,371,0002,121,728stderr
9Aug 17, 2026 06:587,009239,495,601223,871,0007,439,0002,121,728stderr