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 listApr 23, 2026 22:47olliecrowolliecrowScore: 6,038Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 23, 2026 22:485,876176,292,834438,946,0008,978,0002,551,808
2Apr 23, 2026 22:485,922177,669,945433,930,00011,970,0002,547,712
3Apr 23, 2026 22:485,965178,961,109445,375,00010,008,0002,711,552
4Apr 23, 2026 22:486,016180,483,053449,422,0008,968,0002,510,848
5Apr 23, 2026 22:486,038181,167,562436,437,0008,988,0002,572,288
6Apr 23, 2026 22:486,047181,417,723439,752,0008,994,0002,777,088
7Apr 23, 2026 22:486,049181,477,961450,492,0007,990,0002,514,944
8Apr 23, 2026 22:486,051181,542,435430,035,0009,977,0002,523,136
9Apr 23, 2026 22:486,070182,110,708451,238,0009,983,0002,764,800