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 23, 2026 07:36Matthias GörgensMatthias GörgensScore: 2,639Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 07:372,60078,004,073181,143,0001,060,0002,146,304stderr
2Sep 23, 2026 07:372,60578,176,603180,705,0001,072,0002,146,304stderr
3Sep 23, 2026 07:372,60878,249,474180,625,0001,033,0002,146,304stderr
4Sep 23, 2026 07:372,62978,873,433180,585,0001,045,0002,146,304stderr
5Sep 23, 2026 07:372,63979,176,197181,542,0001,071,0002,146,304stderr
6Sep 23, 2026 07:372,64379,302,676180,897,0001,054,0002,146,304stderr
7Sep 23, 2026 07:372,64479,334,584181,185,0001,052,0002,146,304stderr
8Sep 23, 2026 07:372,65679,683,955181,428,0001,048,0002,146,304stderr
9Sep 23, 2026 07:372,65879,758,290181,052,0002,040,0002,146,304stderr