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:54Haha ExpertHaha ExpertScore: 50,144Success
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:5650,0691,502,088,5431,356,299,000133,845,0002,121,728
2Sep 12, 2026 05:5650,0791,502,391,2711,355,495,000134,235,0002,117,632
3Sep 12, 2026 05:5650,0961,502,885,5321,357,346,000133,407,0002,121,728
4Sep 12, 2026 05:5650,1341,504,045,4301,357,647,000134,394,0002,121,728
5Sep 12, 2026 05:5650,1441,504,320,3641,361,407,000130,914,0002,121,728
6Sep 12, 2026 05:5650,1511,504,557,6481,357,285,000135,264,0002,117,632
7Sep 12, 2026 05:5650,1841,505,538,1451,358,450,000135,222,0002,121,728
8Sep 12, 2026 05:5650,2111,506,352,1361,362,852,000131,501,0002,121,728
9Sep 12, 2026 05:5650,2871,508,627,0991,363,870,000132,850,0002,117,632