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 listJun 6, 2026 14:23Victor MerckléVictor MerckléScore: 4,461Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 14:244,335130,078,626358,190,0004,632,0002,646,016
2Jun 6, 2026 14:244,439133,181,623359,018,0004,306,0002,646,016
3Jun 6, 2026 14:244,451133,540,751366,982,0003,450,0002,650,112
4Jun 6, 2026 14:244,459133,781,871363,218,0004,314,0002,641,920
5Jun 6, 2026 14:244,461133,857,430367,874,0004,299,0002,646,016
6Jun 6, 2026 14:244,477134,336,915364,542,0004,313,0002,641,920
7Jun 6, 2026 14:244,490134,720,036368,364,0004,339,0002,646,016
8Jun 6, 2026 14:244,561136,834,438374,009,0004,254,0002,641,920
9Jun 6, 2026 14:244,613138,394,505372,116,0004,511,0002,641,920