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 listMar 14, 2026 16:42Dominique GarmierDominique GarmierScore: 55,404Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 14, 2026 16:4244,0221,320,648,6383,748,864,00034,952,0002,527,232
2Mar 14, 2026 16:4244,2571,327,720,1773,767,666,00028,959,0002,682,880
3Mar 14, 2026 16:4255,1441,654,323,2494,635,430,00036,963,0002,777,088
4Mar 14, 2026 16:4255,3531,660,590,5374,621,209,00033,972,0002,686,976
5Mar 14, 2026 16:4255,4041,662,110,5214,609,628,00033,982,0002,936,832
6Mar 14, 2026 16:4255,7451,672,335,8654,583,019,00038,957,0002,535,424
7Mar 14, 2026 16:4256,5601,696,804,7464,606,051,00035,969,0002,678,784
8Mar 14, 2026 16:4256,6421,699,267,5924,604,271,00036,962,0002,457,600
9Mar 14, 2026 16:4265,0641,951,927,1354,458,311,00033,964,0002,326,528