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 listJul 27, 2026 06:46Andrew TsibinAndrew TsibinScore: 10,713Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 06:4710,680320,416,819304,194,0005,188,0002,138,112
2Jul 27, 2026 06:4710,691320,740,226304,869,0005,335,0002,138,112
3Jul 27, 2026 06:4710,693320,797,931305,306,0005,086,0002,138,112
4Jul 27, 2026 06:4710,704321,135,916306,464,0004,028,0002,138,112
5Jul 27, 2026 06:4710,713321,405,205305,975,0005,005,0002,138,112
6Jul 27, 2026 06:4710,788323,655,171307,087,0006,076,0002,138,112
7Jul 27, 2026 06:4710,833325,016,102306,393,0008,254,0002,138,112
8Jul 27, 2026 06:4711,093332,794,992307,601,0008,358,00045,056
9Jul 27, 2026 06:4711,377341,311,975307,451,00023,358,0002,138,112