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 16, 2026 23:12Tomislav TunkovicTomislav TunkovicScore: 3,600Success
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 04:593,575126,166,923116,980,0001,012,00020,480
2Aug 17, 2026 04:593,576126,026,475117,023,0001,003,00020,480
3Aug 17, 2026 04:593,596126,701,457117,638,0001,058,00020,480
4Aug 17, 2026 04:593,599126,765,365117,721,0001,056,00020,480
5Aug 17, 2026 04:593,600128,412,431117,753,0001,050,00020,480
6Aug 17, 2026 04:593,604128,836,996117,902,0001,059,00020,480
7Aug 17, 2026 04:593,605127,527,491117,947,0001,048,00020,480
8Aug 17, 2026 04:593,607127,240,247118,010,0001,022,00020,480
9Aug 17, 2026 04:593,608127,221,523118,028,0001,038,00020,480