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 listFeb 6, 2025 10:24NoSIMD_C#NoSIMD_C#Score: 87,139Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 6, 2025 10:2486,3992,876,024,4282,808,185,00042,972,0002,498,560
2Feb 6, 2025 10:2486,4792,883,611,3642,799,841,00053,977,0002,531,328
3Feb 6, 2025 10:2486,8522,897,930,8552,828,131,00037,974,0002,486,272
4Feb 6, 2025 10:2487,1012,900,768,9132,835,350,00038,977,0002,535,424
5Feb 6, 2025 10:2487,1392,905,712,5262,816,604,00058,970,0002,306,048
6Feb 6, 2025 10:2487,1622,902,937,4332,829,376,00046,973,0002,326,528
7Feb 6, 2025 10:2487,1792,904,595,3082,830,949,00045,966,0002,531,328
8Feb 6, 2025 10:2487,7402,921,417,9902,836,466,00058,968,0002,347,008
9Feb 6, 2025 10:2487,7942,924,106,7752,839,229,00057,963,0002,478,080