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 listSep 12, 2026 05:45Haha ExpertHaha ExpertScore: 63,538Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2026 05:4763,2731,898,213,5591,795,730,00090,667,0002,150,400
2Sep 12, 2026 05:4763,2871,898,624,9641,796,030,00090,677,0002,142,208
3Sep 12, 2026 05:4763,3791,901,399,5271,798,631,00090,775,0002,117,632
4Sep 12, 2026 05:4763,4001,902,013,4661,799,318,00090,712,0002,117,632
5Sep 12, 2026 05:4763,5381,906,156,1651,802,362,00091,644,0002,129,920
6Sep 12, 2026 05:4763,5401,906,209,6181,803,133,00091,066,0002,117,632
7Sep 12, 2026 05:4763,5831,907,497,1441,805,008,00090,660,0002,142,208
8Sep 12, 2026 05:4763,8101,914,316,8801,807,551,00090,792,0002,117,632
9Sep 12, 2026 05:4764,0911,922,752,3031,818,463,00092,126,0002,129,920