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 listAug 24, 2026 09:16Victor MerckléVictor MerckléScore: 1,691Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 09:171,67850,352,460119,155,0002,297,0002,170,880stderr
2Aug 24, 2026 09:171,67850,345,585119,406,0001,047,0002,170,880stderr
3Aug 24, 2026 09:171,68750,631,442120,207,0002,016,0002,170,880stderr
4Aug 24, 2026 09:171,68850,642,003121,190,0001,007,0002,170,880stderr
5Aug 24, 2026 09:171,69150,736,722119,140,0001,024,0002,170,880stderr
6Aug 24, 2026 09:171,69350,810,409120,709,0002,025,0002,170,880stderr
7Aug 24, 2026 09:171,71051,314,364119,909,0002,008,0002,170,880stderr
8Aug 24, 2026 09:171,71651,483,081119,942,0001,005,0002,170,880stderr
9Aug 24, 2026 09:171,71951,598,893120,643,0001,034,0002,170,880stderr