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 18, 2026 16:25M-RochatM-RochatScore: 20,858Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 18, 2026 16:2620,641619,234,080605,932,0003,544,0002,113,536
2May 18, 2026 16:2620,663619,896,510606,998,0003,469,0002,113,536
3May 18, 2026 16:2620,689620,690,987606,871,0003,495,0002,113,536
4May 18, 2026 16:2620,751622,558,860608,835,0003,041,0002,113,536
5May 18, 2026 16:2620,858625,750,985610,731,0003,508,0002,113,536
6May 18, 2026 16:2620,864625,937,359610,830,0003,082,0002,113,536
7May 18, 2026 16:2622,165664,979,938652,021,0003,461,0002,113,536
8May 18, 2026 16:2622,211666,359,046652,226,0003,418,0002,113,536
9May 18, 2026 16:2622,372671,163,268656,547,0003,015,0002,113,536