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:13Shikhar SoniShikhar SoniScore: 35,057Success
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:1434,9011,047,035,5441,027,292,0009,899,0002,125,824
2Jun 26, 2026 17:1434,9201,047,613,6981,027,874,0009,756,0002,125,824
3Jun 26, 2026 17:1434,9721,049,185,8291,029,569,0009,746,0002,125,824
4Jun 26, 2026 17:1434,9791,049,380,1251,028,219,00010,854,0002,125,824
5Jun 26, 2026 17:1435,0571,051,727,3941,032,443,0009,455,0002,125,824
6Jun 26, 2026 17:1435,0891,052,691,1191,032,878,0009,851,0002,125,824
7Jun 26, 2026 17:1435,0991,052,989,7931,033,021,00010,078,0002,125,824
8Jun 26, 2026 17:1435,1071,053,235,1451,033,659,0009,612,0002,125,824
9Jun 26, 2026 17:1436,5631,096,913,4901,075,377,00011,301,0002,125,824