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 listApr 29, 2026 14:21TudyMTudyMScore: 11,261Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 29, 2026 14:2210,602318,066,712865,002,00016,000,0002,703,360
2Apr 29, 2026 14:2210,622318,662,245860,821,00017,996,0002,633,728
3Apr 29, 2026 14:2210,673320,196,342866,168,00016,983,0002,777,088
4Apr 29, 2026 14:2210,951328,549,628886,186,00013,987,0002,600,960
5Apr 29, 2026 14:2211,261337,836,639919,329,00015,988,0002,699,264
6Apr 29, 2026 14:2211,268338,041,188912,545,00020,989,0002,596,864
7Apr 29, 2026 14:2211,341340,252,588921,609,00013,978,0002,633,728
8Apr 29, 2026 14:2211,401342,048,342915,292,00019,962,0002,715,648
9Apr 29, 2026 14:2211,463343,918,699925,788,00011,997,0002,514,944