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 listMay 22, 2026 19:28M-RochatM-RochatScore: 47,564Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 22, 2026 19:2947,3621,420,869,0481,398,839,0009,028,0002,117,632
2May 22, 2026 19:2947,4191,422,593,6201,401,600,00010,109,0002,117,632
3May 22, 2026 19:2947,4531,423,603,7201,402,287,00010,013,0002,117,632
4May 22, 2026 19:2947,4751,424,255,8491,403,348,0008,008,0002,117,632
5May 22, 2026 19:2947,5641,426,946,9211,407,119,0008,204,0002,117,632
6May 22, 2026 19:2947,7011,431,052,4521,410,606,0009,230,0002,117,632
7May 22, 2026 19:2947,7841,433,523,2551,413,438,0009,024,0002,113,536
8May 22, 2026 19:2947,8851,436,554,4111,414,833,0008,038,0002,117,632
9May 22, 2026 19:2947,9771,439,333,2781,418,134,00010,113,0002,113,536