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 24, 2026 03:49Victor MerckléVictor MerckléScore: 28,836Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 24, 2026 03:5028,737862,122,278777,507,00076,866,0002,113,536
2Jun 24, 2026 03:5028,739862,182,924777,485,00077,082,0002,113,536
3Jun 24, 2026 03:5028,793863,800,135777,756,00078,242,0002,113,536
4Jun 24, 2026 03:5028,823864,696,328779,792,00077,164,0002,113,536
5Jun 24, 2026 03:5028,836865,107,349780,333,00077,277,0002,113,536
6Jun 24, 2026 03:5028,845865,361,182779,898,00077,574,0002,113,536
7Jun 24, 2026 03:5028,882866,461,258781,733,00077,193,0002,113,536
8Jun 24, 2026 03:5028,892866,762,935781,831,00076,996,0002,113,536
9Jun 24, 2026 03:5029,027870,822,687785,381,00077,710,0002,113,536