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 4, 2025 01:45Yehor BondarYehor BondarScore: 251,134Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 4, 2025 01:45250,2878,288,022,3768,232,475,00026,981,0002,445,312
2Dec 4, 2025 01:45250,3608,294,468,4508,238,894,00022,985,0002,469,888
3Dec 4, 2025 01:45250,5758,306,640,3998,240,991,00027,982,0002,531,328
4Dec 4, 2025 01:45250,8348,308,730,9428,257,525,00019,989,0002,514,944
5Dec 4, 2025 01:45251,1348,313,616,5148,271,446,00015,991,0002,490,368
6Dec 4, 2025 01:45251,5078,333,863,0708,276,749,00022,985,0002,396,160
7Dec 4, 2025 01:45251,5188,323,854,9148,273,106,00026,984,0002,289,664
8Dec 4, 2025 01:45251,7678,339,689,8428,288,325,00019,988,0002,416,640
9Dec 4, 2025 01:45253,9548,411,804,7278,361,501,00018,987,0002,289,664