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:52Haha ExpertHaha ExpertScore: 92,799Success
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:5365,4731,964,208,7621,223,981,000433,773,0002,121,728
2Sep 12, 2026 05:5386,4752,594,265,9411,282,534,000711,557,0002,121,728
3Sep 12, 2026 05:5386,6572,599,729,5331,265,621,000677,460,0002,117,632
4Sep 12, 2026 05:5390,0582,701,752,4851,278,821,000759,884,0002,117,632
5Sep 12, 2026 05:5392,7992,783,991,9871,265,654,000623,534,0002,117,632
6Sep 12, 2026 05:5396,2272,886,829,8421,295,217,000783,863,0002,125,824
7Sep 12, 2026 05:5396,3772,891,314,6521,289,703,000799,908,0002,117,632
8Sep 12, 2026 05:5396,5972,897,926,4101,296,111,000794,699,0002,117,632
9Sep 12, 2026 05:5396,6562,899,684,8881,296,837,000800,844,0002,117,632