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 25, 2026 23:53Victor MerckléVictor MerckléScore: 2,920Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2026 23:542,88786,617,262232,117,0002,050,0002,658,304
2Jun 25, 2026 23:542,90787,235,776235,306,0001,005,0002,662,400
3Jun 25, 2026 23:542,90887,264,284236,013,00002,662,400
4Jun 25, 2026 23:542,91587,455,117234,873,0002,112,0002,662,400
5Jun 25, 2026 23:542,92087,628,427233,737,0003,166,0002,662,400
6Jun 25, 2026 23:542,92887,851,494235,109,0003,078,0002,658,304
7Jun 25, 2026 23:542,94588,363,793236,608,0003,098,0002,658,304
8Jun 25, 2026 23:542,95288,581,192234,747,0003,118,0002,662,400
9Jun 25, 2026 23:543,01990,575,199240,983,00002,662,400