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 08:46M-RochatM-RochatScore: 21,348Success
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 08:4721,095632,861,249619,876,0003,011,0002,113,536
2May 18, 2026 08:4721,111633,331,433619,742,0004,025,0002,113,536
3May 18, 2026 08:4721,134634,043,878620,485,0003,011,0002,113,536
4May 18, 2026 08:4721,341640,238,675624,762,0003,010,0002,113,536
5May 18, 2026 08:4721,348640,443,320626,744,0004,024,0002,113,536
6May 18, 2026 08:4721,450643,518,452628,044,0004,106,0002,113,536
7May 18, 2026 08:4722,554676,638,716663,212,0004,022,0002,113,536
8May 18, 2026 08:4722,582677,488,794663,375,0004,110,0002,113,536
9May 18, 2026 08:4722,713681,402,724663,689,0004,005,0002,113,536