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:33TudyMTudyMScore: 69,336Success
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:3663,6641,909,941,4081,847,169,00043,833,0002,547,712
2May 3, 2026 20:3664,1491,924,496,0831,857,623,00046,362,0002,539,520
3May 3, 2026 20:3664,8901,946,718,8631,883,272,00045,042,0002,539,520
4May 3, 2026 20:3669,0412,071,255,6412,005,111,00047,113,0002,539,520
5May 3, 2026 20:3669,3362,080,085,8042,015,047,00046,741,0002,506,752
6May 3, 2026 20:3669,6822,090,477,2832,025,368,00046,887,0002,543,616
7May 3, 2026 20:3669,8922,096,786,8622,025,271,00046,755,0002,539,520
8May 3, 2026 20:3669,9592,098,771,8202,031,557,00046,973,0002,527,232
9May 3, 2026 20:3670,4262,112,804,7002,044,983,00047,045,0002,543,616