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 26, 2026 17:35Shikhar SoniShikhar SoniScore: 35,907Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 26, 2026 17:3635,7771,073,312,3231,045,951,00017,429,0002,125,824
2Jun 26, 2026 17:3635,8311,074,944,3321,048,709,00016,234,0002,125,824
3Jun 26, 2026 17:3635,8381,075,145,9911,048,157,00016,952,0002,125,824
4Jun 26, 2026 17:3635,8841,076,543,7631,049,872,00016,261,0002,125,824
5Jun 26, 2026 17:3635,9071,077,220,9671,050,114,00016,785,0002,125,824
6Jun 26, 2026 17:3635,9771,079,335,3741,052,999,00016,439,0002,125,824
7Jun 26, 2026 17:3635,9791,079,397,2741,052,647,00016,394,0002,125,824
8Jun 26, 2026 17:3636,0861,082,587,0901,056,342,00016,356,0002,125,824
9Jun 26, 2026 17:3636,1261,083,782,6021,056,524,00016,044,0002,125,824