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 listDec 28, 2025 13:45zypehzypehScore: 62,742Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2025 13:4562,3522,087,712,0582,033,636,00023,983,0002,347,008
2Dec 28, 2025 13:4562,5162,095,453,4342,035,028,00027,986,0002,351,104
3Dec 28, 2025 13:4562,6172,089,467,9962,040,373,00025,992,0002,281,472
4Dec 28, 2025 13:4562,7212,100,406,5502,044,807,00024,985,0002,281,472
5Dec 28, 2025 13:4562,7422,105,626,7762,045,508,00024,981,0002,289,664
6Dec 28, 2025 13:4562,7612,102,292,8702,047,140,00023,989,0002,461,696
7Dec 28, 2025 13:4562,8122,098,476,2962,051,799,00020,987,0002,535,424
8Dec 28, 2025 13:4563,1232,113,300,5812,057,073,00025,988,0002,342,912
9Dec 28, 2025 13:4563,4902,126,916,8582,070,188,00024,978,0002,281,472