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 21, 2026 19:33Charles CabergsCharles CabergsScore: 17,325Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 21, 2026 19:3317,054511,643,7021,460,989,00019,972,0002,977,792
2Apr 21, 2026 19:3317,208516,264,8731,459,638,00016,995,0002,805,760
3Apr 21, 2026 19:3317,225516,777,6621,457,585,00021,978,0002,945,024
4Apr 21, 2026 19:3317,271518,157,1811,458,628,00021,994,0002,670,592
5Apr 21, 2026 19:3317,325519,770,0351,462,468,00014,994,0002,727,936
6Apr 21, 2026 19:3317,509525,286,3911,460,593,00023,976,0002,744,320
7Apr 21, 2026 19:3317,554526,644,4581,477,696,00020,995,0002,711,552
8Apr 21, 2026 19:3317,693530,817,9571,509,161,00020,960,0002,859,008
9Apr 21, 2026 19:3317,957538,719,7891,505,820,00021,968,0002,351,104