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 13:57Victor MerckléVictor MerckléScore: 4,539Success
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 13:584,426132,800,298363,039,0004,500,0002,646,016
2Jun 6, 2026 13:584,516135,509,919376,010,0003,287,0002,646,016
3Jun 6, 2026 13:584,523135,695,769370,170,0004,540,0002,641,920
4Jun 6, 2026 13:584,535136,071,531374,348,0005,417,0002,646,016
5Jun 6, 2026 13:584,539136,191,830375,325,0004,343,0002,646,016
6Jun 6, 2026 13:584,550136,501,282374,526,0004,474,0002,650,112
7Jun 6, 2026 13:584,553136,612,749371,506,0005,491,0002,641,920
8Jun 6, 2026 13:584,554136,623,484376,775,0004,594,0002,646,016
9Jun 6, 2026 13:584,557136,731,420374,608,0003,460,0002,650,112