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 listAug 17, 2026 04:04marko1597marko1597Score: 9,074Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 17, 2026 04:319,045271,373,893251,234,00011,757,0002,121,728stderr
2Aug 17, 2026 04:319,052271,580,041251,543,00011,809,0002,121,728stderr
3Aug 17, 2026 04:319,064271,931,986251,893,00011,766,0002,121,728stderr
4Aug 17, 2026 04:319,068272,049,249251,886,00011,768,0002,121,728stderr
5Aug 17, 2026 04:319,074272,235,553252,128,00011,674,0002,121,728stderr
6Aug 17, 2026 04:319,077272,333,776251,967,00011,982,0002,121,728stderr
7Aug 17, 2026 04:319,114273,433,380252,265,00012,045,0002,121,728stderr
8Aug 17, 2026 04:319,227276,836,726256,649,00011,595,0002,121,728stderr
9Aug 17, 2026 04:319,340280,211,206259,712,00012,098,0002,121,728stderr