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:12M-RochatM-RochatScore: 31,859Success
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:1331,827954,825,816922,048,00022,521,0002,117,632
2May 22, 2026 19:1331,844955,337,110921,775,00022,700,0002,117,632
3May 22, 2026 19:1331,848955,448,718922,615,00022,586,0002,117,632
4May 22, 2026 19:1331,851955,557,854922,598,00022,608,0002,117,632
5May 22, 2026 19:1331,859955,779,511922,812,00022,716,0002,117,632
6May 22, 2026 19:1331,894956,832,566923,214,00022,524,0002,117,632
7May 22, 2026 19:1331,914957,425,031924,545,00022,594,0002,117,632
8May 22, 2026 19:1331,933958,017,957923,147,00022,424,0002,117,632
9May 22, 2026 19:1331,985959,572,329924,908,00022,298,0002,117,632