Unique strings v2 Sergey Svistunov

Same problem as Unique strings, but with 3 CPUs available and scoring based on wall time instead of CPU time.

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 31, 2025 13:28Aniruddha DebAniruddha DebScore: 8,999Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 31, 2025 13:288,743262,281,545338,367,00063,692,0002,854,912
2Dec 31, 2025 13:288,894266,827,174335,843,00061,971,0002,646,016
3Dec 31, 2025 13:288,912267,368,564337,239,00060,862,0002,641,920
4Dec 31, 2025 13:288,998269,945,098352,476,00058,746,0002,859,008
5Dec 31, 2025 13:288,999269,976,828338,504,00059,912,0002,904,064
6Dec 31, 2025 13:289,061271,834,888344,324,00065,061,0002,809,856
7Dec 31, 2025 13:289,160274,787,104346,913,00056,659,0002,752,512
8Dec 31, 2025 13:289,254277,606,842347,456,00063,082,0002,822,144
9Dec 31, 2025 13:289,283278,481,450343,968,00067,796,0002,797,568