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:33Shikhar SoniShikhar SoniScore: 32,110Success
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:3432,040961,217,008941,408,0009,938,0002,125,824
2Jun 27, 2026 07:3432,083962,505,774943,210,0009,413,0002,125,824
3Jun 27, 2026 07:3432,105963,153,549942,708,0009,307,0002,125,824
4Jun 27, 2026 07:3432,110963,323,087943,913,0009,577,0002,125,824
5Jun 27, 2026 07:3432,110963,328,488944,075,0009,333,0002,125,824
6Jun 27, 2026 07:3432,139964,181,848945,159,0009,231,0002,125,824
7Jun 27, 2026 07:3432,170965,121,074945,867,0009,370,0002,125,824
8Jun 27, 2026 07:3432,186965,588,753946,136,0009,528,0002,125,824
9Jun 27, 2026 07:3432,297968,933,742949,337,0009,652,0002,125,824