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 27, 2026 07:43Shikhar SoniShikhar SoniScore: 32,173Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 27, 2026 07:4432,034961,033,100941,534,0009,640,0002,125,824
2Jun 27, 2026 07:4432,126963,782,230944,356,0009,354,0002,125,824
3Jun 27, 2026 07:4432,157964,736,632945,198,0009,610,0002,125,824
4Jun 27, 2026 07:4432,161964,856,170945,069,0009,796,0002,125,824
5Jun 27, 2026 07:4432,173965,204,341945,737,0009,489,0002,125,824
6Jun 27, 2026 07:4432,225966,752,962945,866,00010,925,0002,125,824
7Jun 27, 2026 07:4432,232966,979,739946,362,00010,743,0002,125,824
8Jun 27, 2026 07:4432,264967,929,555948,403,0009,492,0002,125,824
9Jun 27, 2026 07:4432,296968,894,522949,306,0009,791,0002,125,824