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:04TudyMTudyMScore: 20,790Success
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:1020,233606,997,1321,702,626,00027,993,0002,670,592
2Apr 29, 2026 14:1020,542616,278,6401,713,876,00026,935,0002,949,120
3Apr 29, 2026 14:1020,707621,214,4901,738,808,00036,953,0002,572,288
4Apr 29, 2026 14:1020,752622,576,0921,754,401,00027,958,0002,695,168
5Apr 29, 2026 14:1020,790623,702,2081,745,509,00028,958,0002,781,184
6Apr 29, 2026 14:1020,828624,860,7411,752,125,00026,955,0002,629,632
7Apr 29, 2026 14:1020,841625,243,1171,747,306,00024,961,0002,932,736
8Apr 29, 2026 14:1020,865625,976,4871,744,330,00027,941,0002,977,792
9Apr 29, 2026 14:1020,884626,530,8881,755,631,00028,960,0002,736,128