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 22, 2026 00:03A_ShamanA_ShamanScore: 106,629Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 22, 2026 00:04106,2683,188,063,0823,048,718,000129,862,0002,117,632
2Jun 22, 2026 00:04106,4793,194,375,6633,057,514,000126,846,0002,113,536
3Jun 22, 2026 00:04106,4923,194,781,3543,057,314,000127,728,0002,117,632
4Jun 22, 2026 00:04106,5813,197,431,3103,059,108,000128,333,0002,113,536
5Jun 22, 2026 00:04106,6293,198,871,3573,063,726,000125,076,0002,113,536
6Jun 22, 2026 00:04106,6663,199,983,8523,060,915,000129,634,0002,117,632
7Jun 22, 2026 00:04106,7043,201,136,1943,059,931,000131,200,0002,113,536
8Jun 22, 2026 00:04107,0693,212,090,4183,073,682,000128,622,0002,117,632
9Jun 22, 2026 00:04107,6703,230,101,5043,091,891,000127,400,0002,113,536