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 listJun 7, 2026 17:59anboto1anboto1Score: 22,104Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 7, 2026 18:0021,831729,750,772713,662,0006,782,0002,113,536
2Jun 7, 2026 18:0021,903732,197,135716,045,0006,776,0002,113,536
3Jun 7, 2026 18:0022,044737,010,565720,652,0006,816,0002,113,536
4Jun 7, 2026 18:0022,104738,790,896722,799,0006,638,0002,113,536
5Jun 7, 2026 18:0022,104740,159,183722,650,0006,800,0002,113,536
6Jun 7, 2026 18:0022,364747,782,438731,256,0006,784,0002,113,536
7Jun 7, 2026 18:0022,524752,549,870736,556,0006,738,0002,113,536
8Jun 7, 2026 18:0022,999768,427,403751,907,0007,066,0002,113,536
9Jun 7, 2026 18:0023,060770,263,352754,087,0006,902,0002,113,536