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:22M-RochatM-RochatScore: 28,601Success
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:2328,297848,923,034828,106,00011,289,0002,113,536
2May 22, 2026 19:2328,347850,432,294829,405,00011,365,0002,113,536
3May 22, 2026 19:2328,388851,667,245829,629,00011,423,0002,113,536
4May 22, 2026 19:2328,574857,243,480835,575,00011,428,0002,113,536
5May 22, 2026 19:2328,601858,035,060834,664,00011,466,0002,113,536
6May 22, 2026 19:2328,644859,322,368835,295,00011,495,0002,113,536
7May 22, 2026 19:2328,665859,974,229838,159,00011,427,0002,113,536
8May 22, 2026 19:2328,668860,069,843836,674,00013,710,0002,113,536
9May 22, 2026 19:2328,713861,418,961838,354,00011,506,0002,113,536