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 3, 2026 20:18TudyMTudyMScore: 24,837Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2026 20:1924,639739,171,468650,098,00073,418,0002,322,432
2May 3, 2026 20:1924,732741,974,854648,994,00075,819,0002,355,200
3May 3, 2026 20:1924,752742,561,609652,992,00073,495,0002,609,152
4May 3, 2026 20:1924,791743,738,810651,552,00074,136,0002,605,056
5May 3, 2026 20:1924,837745,125,077651,415,00076,232,0002,609,152
6May 3, 2026 20:1924,850745,521,017652,345,00074,669,0002,613,248
7May 3, 2026 20:1924,856745,684,470651,925,00076,134,0002,592,768
8May 3, 2026 20:1924,903747,108,422652,267,00076,991,0002,584,576
9May 3, 2026 20:1924,958748,766,964656,507,00076,011,0002,617,344