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 12:53Victor MerckléVictor MerckléScore: 5,321Success
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 12:545,276158,306,403437,062,0008,053,0002,600,960
2Jun 6, 2026 12:545,289158,675,961434,838,0009,079,0002,600,960
3Jun 6, 2026 12:545,320159,622,860438,536,0007,901,0002,600,960
4Jun 6, 2026 12:545,320159,610,744442,089,0007,958,0002,600,960
5Jun 6, 2026 12:545,321159,631,197440,170,0007,859,0002,596,864
6Jun 6, 2026 12:545,324159,731,885439,338,0008,071,0002,596,864
7Jun 6, 2026 12:545,332159,974,394440,335,0007,917,0002,596,864
8Jun 6, 2026 12:545,391161,752,923441,410,0007,913,0002,600,960
9Jun 6, 2026 12:545,414162,430,066444,603,0008,132,0002,596,864