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 9, 2026 23:36Victor MerckléVictor MerckléScore: 3,108Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 9, 2026 23:373,08192,455,398243,142,0001,028,0002,138,112
2Jun 9, 2026 23:373,09992,986,004245,489,0001,009,0002,138,112
3Jun 9, 2026 23:373,10493,149,055245,061,0001,007,0002,138,112
4Jun 9, 2026 23:373,10593,177,806245,311,00002,138,112
5Jun 9, 2026 23:373,10893,246,596244,398,0002,030,0002,138,112
6Jun 9, 2026 23:373,14794,415,404250,291,00002,138,112
7Jun 9, 2026 23:373,15094,516,844244,825,0002,042,0002,138,112
8Jun 9, 2026 23:373,19495,826,767247,969,0001,136,0002,138,112
9Jun 9, 2026 23:373,20196,032,098249,735,0001,119,0002,138,112