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 11:28M-RochatM-RochatScore: 20,552Success
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 11:2920,242607,276,564592,380,0004,112,0002,113,536
2May 22, 2026 11:2920,298608,966,923592,704,0004,112,0002,113,536
3May 22, 2026 11:2920,328609,843,041594,575,0004,092,0002,113,536
4May 22, 2026 11:2920,333610,011,417593,464,0004,194,0002,113,536
5May 22, 2026 11:2920,552616,560,082601,171,0004,085,0002,113,536
6May 22, 2026 11:2920,557616,721,589600,029,0004,011,0002,113,536
7May 22, 2026 11:2920,932627,967,405612,464,0004,264,0002,113,536
8May 22, 2026 11:2921,968659,069,026644,408,0004,124,0002,113,536
9May 22, 2026 11:2922,034661,026,259646,575,0004,195,0002,113,536